问题描述
Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.
In a UNIX-style file system, a period . refers to the current directory. Furthermore, a double period … moves the directory up a level. For more information, see: Absolute path vs relative path in Linux/Unix
Note that the returned canonical path must always begin with a slash /, and there must be only a single slash / between two directory names. The last directory name (if it exists) must not end with a trailing /. Also, the canonical path must be the shortest string representing the absolute path.
Example 1:
Input: “/home/”
Output: “/home”
Explanation: Note that there is no trailing slash after the last directory name.
Example 2:
Input: “/…/”
Output: “/”
Explanation: Going one level up from the root directory is a no-op, as the root level is the highest level you can go.
Example 3:
Input: “/home//foo/”
Output: “/home/foo”
Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.
Example 4:
Input: “/a/./b/…/…/c/”
Output: “/c”
Example 5:
Input: “/a/…/…/b/…/c//.//”
Output: “/c”
Example 6:
Input: “/a//bc/d//././/…”
Output: “/a/b/c”
解题思路
根据题意和实例,我第一想到的解题思路是通过栈的操作实现。利用Arrays工具的split()方法将字符串以“/”分隔。遍历字符串数组时,当遇到"…“的时候则出栈,不是”" 和"."则进栈,遍历字符串数组,得到最终的简化路径。
代码
class Solution {
public String simplifyPath(String path) {
char[] c1 = path.toCharArray();
int len = c1.length;
Stack<String> stack = new Stack<String>();
String[] str = path.split("/");
for(int i = 0; i < str.length; i++) {
if("".equals(str[i])) {
continue;
}else if(".".equals(str[i])) {
continue;
}else if("..".equals(str[i]) ) {
if(!stack.empty()) {
stack.pop();
}
}else {
stack.push("/"+str[i]);
}
}
int n = stack.size();
if(n == 0) return "/";
String[] res = new String[n];
while(!(stack.empty())) res[--n] = stack.pop();
StringBuilder sb = new StringBuilder();
for(int i = 0; i < res.length; i++) {
sb.append(res[i]);
}
return sb.toString();
}
}
注:由于用markdown编写,表示当前目录的上一目录的两个点,不知道为什么显示是三个点