FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithms/algorithms/stack/simplify_path.py at master · NiklasBeierl/algorithms · GitHub
NiklasBeierl
/
algorithms
Public
forked from
keon/algorithms
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithms
/
algorithms
/
stack
/
simplify_path.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
28 lines (26 loc) · 756 Bytes
Breadcrumbs
algorithms
/
algorithms
/
stack
/
simplify_path.py
Copy path
File metadata and controls
28 lines (26 loc) · 756 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
"""
Given an absolute path for a file (Unix-style), simplify it.
For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"
* 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".
"""
def
simplify_path
(
path
):
"""
:type path: str
:rtype: str
"""
skip
=
{
'..'
,
'.'
,
''
}
stack
=
[]
paths
=
path
.
split
(
'/'
)
for
tok
in
paths
:
if
tok
==
'..'
:
if
stack
:
stack
.
pop
()
elif
tok
not
in
skip
:
stack
.
append
(
tok
)
return
'/'
+
'/'
.
join
(
stack
)
Back
|
FazBrowse Home
|
New Git URL