71 Simplify Path

Leetcode

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.

---

先根据 / 将 path 分割为字符串数组，从左到右依次加入队列，如果是 .. 且队列不为空则弹出队尾元素，如果是 . 则忽略。然后拼接队列剩余元素。

public String simplifyPath(String path) {
    String[] ss=path.split("/+");
    LinkedList<String> list=new LinkedList<>();
    for(String s:ss){
        if("..".equals(s)){
            if(!list.isEmpty()) list.removeLast();
        } else if (!".".equals(s) && !"".equals(s)){
            list.addLast(s);
        }
        
    }
    if(list.isEmpty()) return "/";
    StringBuilder sb=new StringBuilder();
    for(String s:list){
        sb.append("/").append(s);
    }
    return sb.toString();
    
}