71. Simplify Path
来源: LeetCode 71. Simplify Path
题目描述
71. Simplify Path
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.
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//b////c/d//././/.."
Output: "/a/b/c"
思路分析
处理。 与 。。和 连续 /
将目录名取出
利用/将目录名连起来
如果。。删除上一个数据
。不动
目录名存入
代码
class Solution {
public:
string simplifyPath(string path) {
vector<string>spath;
int end = 0;
int i = 0;
while(i<path.size()){
while(i<path.size() && path[i] == '/') ++i;
int j = i; string s;
while(j<path.size() && path[j] != '/'){
s += path[j];
++j;
} // 提取
if(s.size() && s != "." && s!= "..") {
spath.push_back(s);
++end;
}
else if(s == "..") {
if(spath.size()){
spath.pop_back();
--end;
} // 删除上一级目录
}
i = j;
}
string res;
for(int i=0; i<end; ++i){
res += "/";
res += spath[i];
}
return res.size() == 0 ? path.size() == 0 ? "": "/" : res;
}
};
算法分析
- 时间复杂度:O(n)
- 空间复杂度:O(n)