原题
https://leetcode.cn/problems/simplify-path/description/
思路
字符串转为数组
复杂度
时间:O(n)
空间:O(n)
Python代码
class Solution:
def simplifyPath(self, path: str) -> str:
path_list = path.split('/')
ans = []
for s in path_list:
if s in ['.', ''] :
continue
elif s == '..':
if ans:
ans.pop()
else:
ans.append(s)
return '/' + '/'.join(ans)
Go代码
func simplifyPath(path string) string {
path_list := strings.Split(path, "/")
ans := []string{}
for _, s := range path_list {
if s == "." || s == "" {
continue
} else if s == ".." {
if len(ans) > 0 {
ans = ans[:len(ans)-1]
}
} else {
ans = append(ans, s)
}
}
return "/" + strings.Join(ans, "/")
}
2726

被折叠的 条评论
为什么被折叠?



