71. Simplify Path - LeetCode Solution


String Stack

Python Code:

class Solution:
    def simplifyPath(self, path: str) -> str:
        stack = ["/",]



        path = path.split("/")

        for i in range(len(path)):
            if(path[i] == "." or path[i] == ""):
                continue
            else:
                if(path[i] == ".."):
                    if(len(stack) == 1):
                        continue
                    else:
                        stack.pop()
                        stack.pop()
                else:
                    stack.append(path[i])
                    stack.append("/")



        stack = "".join(stack)

        if(len(stack) == 1):
            return "/"
        else:

            return stack[:len(stack) -1]


Comments

Submit
0 Comments
More Questions

1593A - Elections
1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence