Leetcode Study Day 26

Given a string path, which is an absolute path (starting with a slash ‘/‘) to a file or directory in a Unix-style file system, convert it to the simplified canonical path.

In a Unix-style file system, a period ‘.’ refers to the current directory, a double period ‘..’ refers to the directory up a level, and any multiple consecutive slashes (i.e. ‘//‘) are treated as a single slash ‘/‘. For this problem, any other format of periods such as ‘…’ are treated as file/directory names.

The canonical path should have the following format:

The path starts with a single slash ‘/‘.
Any two directories are separated by a single slash ‘/‘.
The path does not end with a trailing ‘/‘.
The path only contains the directories on the path from the root directory to the target file or directory (i.e., no period ‘.’ or double period ‘..’)
Return the simplified canonical 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.
 

Constraints:

1 <= path.length <= 3000
path consists of English letters, digits, period '.', slash '/' or '_'.
path is a valid absolute Unix path.

Solutions

The solution is using stack to store the the folder names. If we meet “.”, we just skip it, if we meet “..”, we pop the top of the stack, if we meet a folder name, we push it into the stack. After the iteration, we pop the stack and add the folder names to the answer string. If the answer string is empty, we return “/“. If it is not, we return the answer string.

class Solution {
public:
    string simplifyPath(string path) {
        stack<string> stack;
        string answer;
        for (int i = 0; i < path.size(); i++){
            if(path[i] == '/')
                continue;
            string temp = "";
            while (i < path.size() && path[i] != '/'){
                temp += path[i];
                i++;
            }
            if (temp == ".") continue;
            else if (temp == ".."){
                if (!stack.empty())
                    stack.pop();
            }
            else{
                stack.push(temp);
            }
        }

        while (!stack.empty()){
            answer = "/" + stack.top() + answer;
            stack.pop();
        }
        if (answer.size() == 0)
            return "/";
        return answer;
        
    }
};