일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 29 | 30 | 31 |
Tags
- shiba
- 109. Convert Sorted List to Binary Search Tree
- Python Code
- concurrency
- Substring with Concatenation of All Words
- 715. Range Module
- Python
- 315. Count of Smaller Numbers After Self
- 파이썬
- 30. Substring with Concatenation of All Words
- data science
- 43. Multiply Strings
- attribute
- 시바견
- Protocol
- iterator
- Regular Expression
- LeetCode
- kaggle
- 운영체제
- 컴퓨터의 구조
- t1
- Convert Sorted List to Binary Search Tree
- 프로그래머스
- Generator
- Decorator
- Python Implementation
- DWG
- 밴픽
- Class
Archives
- Today
- Total
Scribbling
LeetCode: 71. Simplify Path 본문
class Solution:
def simplifyPath(self, path: str) -> str:
stack = []
paths = path.split('/')
for path in paths:
if path:
if path == '.':
continue
elif path == '..':
if stack:
stack.pop()
else:
stack.append(path)
ret = '/'
for path in stack:
ret += path + '/'
if not stack:
return ret
return ret[:-1]
'Computer Science > Coding Test' 카테고리의 다른 글
LeetCode: 73. Set Matrix Zeroes (0) | 2021.09.28 |
---|---|
LeetCode: 72. Edit Distance (0) | 2021.09.26 |
LeetCode: 69. Sqrt(x) (0) | 2021.09.26 |
LeetCode: 67. Add Binary (0) | 2021.09.26 |
LeetCode: 64. Minimum Path Sum (0) | 2021.09.24 |