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"
.
/.表示本级目录,比如/a/.相当于/a, /..表示返回上级目录,比如/a/../b相当于/b, 这题暗含的条件是多于两个点的是文件名称,比如/...a相当于/...a。
这题用两个栈来保持输入和输出顺序一致,也可以用一个LinkedList来做,下次写注意下。
活用split功能,s.split("/")按照斜杠拆分字符串,假如有多个//相连,也会进行拆分,拆分结果是字符数组中存在很多空串。
Source
public class Solution {
public String simplifyPath(String path) {
Stack<String> stack1 = new Stack<String>();
String[] str = path.split("/");
for(int i = 0; i < str.length; i++){
if(str[i].equals(".") || str[i].length() == 0)
continue;
else if(str[i].equals("..")){
if(!stack1.isEmpty())
stack1.pop();
}
else{
stack1.push(str[i]);
}
}
StringBuffer a = new StringBuffer();
Stack<String> stack2 = new Stack<String>();
while(!stack1.isEmpty()){
stack2.push(stack1.pop());
}
while(!stack2.isEmpty()){
a.append("/" + stack2.pop());
}
if(a.length() == 0) a.append("/");
return a.toString();
}
}
Test
public static void main(String[] args){
String path = "/a/./b/../../c/";
System.out.println(new Solution().simplifyPath(path));
}