您的位置:首页 > 其它

LeetCode-71-Simplify Path 无聊模拟

2017-09-21 13:16 477 查看
class Solution(object):
def simplifyPath(self, path):
"""
:type path: str
:rtype: str
"""
ans="/"
stackLen=1
path+='/'
Len=len(path)
curS=""
for i in range(Len):
if path[i]=='/' :
if curS=="":
continue
if curS=="..":
if stackLen>1:
stackLen-=1
ans=ans[:stackLen]

while(ans[stackLen-1]!='/'):
stackLen-=1
ans=ans[:stackLen]

elif curS==".":
a=1#do nothing
else:
ans+=curS+'/'
stackLen+=len(curS)+1
curS=""
else:
curS+=path[i]

ans+=curS
if len(ans)>1 and ans[stackLen-1]=='/':
ans=ans[:stackLen-1]
return ans
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: