LeetCode——Simplify Path

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. For more information, see: Absolute path vs relative path in Linux/Unix
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: “/home/”
  Output: “/home”
  Explanation: Note that there is no trailing slash after the last directory name.
• Example 2:
  Input: “/…/”
  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: “/home//foo/”
  Output: “/home/foo”
  Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.
• Example 4:
  Input: “/a/./b/…/…/c/”
  Output: “/c”
• Example 5:
  Input: “/a/…/…/b/…/c//.//”
  Output: “/c”
• Example 6:
  Input: “/a//bc/d//././/…”
  Output: “/a/b/c”

解法一

按"/“分隔字符串，判断是否为”…“或者”."，若为字母则加入到list中，若为"…"，弃掉最后一个加入list的字符串，若为"."则跳过。

public String simplifyPath(String path) {
		List<String> S=new LinkedList<String>();
        for(int i=0;i<path.length();i++)
        {
        	while(i<path.length()&&path.charAt(i)=='/')
        		i++;
        	if(i>=path.length())
        		break; 
        	int start=i;
        	while(i<path.length()&&path.charAt(i)!='/')
        		i++;
        	int end=i;
        	String s=path.substring(start,end);
        	if(s.equals(".."))
        	{
        		if(!S.isEmpty())
        			S.remove(S.size()-1);
        	}
        	else if(!s.equals("."))
        		S.add(s);
        }
        if(S.isEmpty())
        	return "/";
        String res="";
        for(int i=0;i<S.size();i++)
        	res=res+"/"+S.get(i);
        return res;
    }

Runtime: 10 ms, faster than 96.18% of Java online submissions for Simplify Path.
Memory Usage: 39.8 MB, less than 22.19% of Java online submissions for Simplify Path.

解法二

利用自带函数

public String simplifyPath(String path) {
        Stack<String> s = new Stack<String>();
        String[] p = path.split("/");
        for (String t : p) {
            if (!s.isEmpty() && t.equals("..")) {
                s.pop();
            } else if (!t.equals(".") && !t.equals("") && !t.equals("..")) {
                s.push(t);
            }
        }
        List<String> list = new ArrayList(s);
        return "/" + String.join("/", list);
	}

Runtime: 14 ms, faster than 56.83% of Java online submissions for Simplify Path.
Memory Usage: 38.2 MB, less than 84.73% of Java online submissions for Simplify Path.

python版

class Solution:
    def simplifyPath(self, path: str) -> str:
        s=[]
        p=path.split('/')
        for t in p:
            if t not in ['.','..','']:
                s.append('/'+t)
            elif t=='..' and s:
                s.pop()
        return ''.join(s) if s else '/'

Runtime: 44 ms, faster than 67.07% of Python3 online submissions for Simplify Path.
Memory Usage: 13.1 MB, less than 5.00% of Python3 online submissions for Simplify Path.