Solve LeetCode Problems and Get Offers From Your Dream Companies
Problem 71. Simplify Path
In this series, I am going to solve Leetcode medium problems live with my friend, which you can watch on our youtube channel, Today we will do Problem 71. Simplify Path.
A little bit about me, I have offers from Uber India and Amazon India in the past, and I am currently working for Booking.com in Amsterdam.
Youtube Discussion
Please comment here or on youtube, if you have any doubts
Problem statement:
Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.
In a UNIX-style file system, a period '.'
refers to the current directory. Furthermore, a double period '..'
moves the directory up a level.
Note that the returned canonical path must always begin with a slash '/'
, and there must be only a single slash '/'
between two directory names. The last directory name (if it exists) must not end with a trailing '/'
. Also, the canonical path must be the shortest string representing the absolute path.
Example 1:
Input: path = "/home/"
Output: "/home"
Explanation: Note that there is no trailing slash after the last directory name.
Example 2:
Input: path = "/../"
Output: "/"
Explanation: Going one level up from the root directory is a no-op, as the root level is the highest level you can go.
Example 3:
Input: path = "/home//foo/"
Output: "/home/foo"
Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.
Example 4:
Input: path = "/a/./b/../../c/"
Output: "/c"
Solution
We need to return the shortest string representing an absolute path. It should begin with ‘/’ and must not end trailing…