Given an absolute path for a file (Unix-style), simplify it.
【leetcode|leetcode 71. Simplify Path【文件路径表达式】】For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"
path = "/a/../../b/../c//.//", => "/c"
path = "/a//bc/d//././/..", => "/a/b/c"
In a UNIX-style file system, a period ('.') refers to the current directory, so it can be ignored in a simplified path. Additionally, a double period ("..") moves up a directory, so it cancels out whatever the last directory was. For more information, look here: https://en.wikipedia.org/wiki/Path_(computing)#Unix_style
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".
居然还有/.../这种无耻的路径
学会了一个新函数
istringstream ss(path);
while(getline(ss, val, '/')){class Solution {
public:
string simplifyPath(string path) {
vectorans;
string val;
istringstream ss(path);
while(getline(ss, val, '/')){
if(val==".."){
if(!ans.empty())
ans.erase(ans.end());
}
else if(val=="."){
continue;
}
else{
if(val!="")
ans.push_back(val);
}
}
string re="";
for(int i=0;
i推荐阅读
- 数据结构与算法|【算法】力扣第 266场周赛
- leetcode|今天开始记录自己的力扣之路
- Python|Python 每日一练 二分查找 搜索旋转排序数组 详解
- 【LeetCode】28.实现strstr（） （KMP超详细讲解，sunday解法等五种方法，java实现）
- LeetCode-35-搜索插入位置-C语言
- leetcode python28.实现strStr()35. 搜索插入位置
- Leetcode Permutation I & II
- python|leetcode Longest Substring with At Most Two Distinct Characters 滑动窗口法
- LeetCode 28 Implement strStr() (C,C++,Java,Python)
- Python|Python Leetcode(665.非递减数列)