71. Simplify Path

最新推荐文章于 2025-06-30 22:33:10 发布

ujn20161222

最新推荐文章于 2025-06-30 22:33:10 发布

阅读量136

点赞数 1

CC 4.0 BY-SA版权

文章标签： leetcode

本文链接：https://blog.csdn.net/ujn20161222/article/details/142913777

71. Simplify Path

class Solution:
    def simplifyPath(self, path: str) -> str:
        stack=[]
        for i in path.split('/'):
            print(i)
            if i =='..':
                if stack:
                    stack.pop()
            elif i=='.' or i=='':continue
            else:
                stack.append(i)
        return '/'+'/'.join(stack)