FilesExpand file tree

 master

/

071_SimplifyPath71.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

56 lines (46 loc) · 1.62 KB

 master

/

071_SimplifyPath71.java

Copy path

Top

File metadata and controls

• Code
• Blame

56 lines (46 loc) · 1.62 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

/**

* Given an absolute path for a file (Unix-style), simplify it.

*

* For example,

* path = "/home/", => "/home"

* path = "/a/./b/../../c/", => "/c"

*

* Corner Cases:

* - Did you consider the case where path = "/../"?

* In this case, you should return "/".

* - Another corner case is the path might contain multiple slashes '/' together, such as "/home//foo/".

* In this case, you should ignore redundant slashes and return "/home/foo".

*/

public class SimplifyPath71 {

public String simplifyPath(String path) {

String[] parts = path.split("/", -1);

List<String> result = new ArrayList<>();

for (String p: parts) {

if (p.equals(".") || p.equals("")) {

continue;

}

if (p.equals("..")) {

if (result.size() > 0) {

result.remove(result.size() - 1);

}

continue;

}

result.add(p);

}

return "/" + String.join("/", result.toArray(new String[result.size()]));

}

/**

* https://discuss.leetcode.com/topic/7675/java-10-lines-solution-with-stack

*/

public String simplifyPath2(String path) {

Deque<String> stack = new LinkedList<>();

Set<String> skip = new HashSet<>(Arrays.asList("..",".",""));

for (String dir : path.split("/")) {

if (dir.equals("..") && !stack.isEmpty()) stack.pop();

else if (!skip.contains(dir)) stack.push(dir);

}

String res = "";

for (String dir : stack) res = "/" + dir + res;

return res.isEmpty() ? "/" : res;

}

}