[LeetCode]Simplify Path

Given an absolute path for a file (Unix-style), simplify it.

For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"
click to show corner cases.

Corner Cases:
Did you consider the case where path = "/../"?
In this case, you should return "/".
Another corner case is the path might contain multiple slashes '/' together, such as "/home//foo/".
In this case, you should ignore redundant slashes and return "/home/foo".

Analysis:

利用栈的特性，如果sub string element
1. 等于“/”，跳过，直接开始寻找下一个element
2. 等于“.”，什么都不需要干，直接开始寻找下一个element
3. 等于“..”，弹出栈顶元素，寻找下一个element
4. 等于其他，插入当前elemnt为新的栈顶，寻找下一个element

最后，再根据栈的内容，重新拼path。这样可以避免处理连续多个“/”的问题。

Java

public String simplifyPath(String path) {
        Stack<String> pathStack = new Stack<>();
		int i=0;
		while(i<path.length()){
			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-1;
			String element = path.substring(start, end+1);
			if(element.equals("..")){
				if(pathStack.size()>0)
					pathStack.pop();
			}
			else if(!element.equals("."))
				pathStack.push(element);
		}
		if(pathStack.size()<=0) return "/";
		StringBuffer simPath = new StringBuffer();
		for(int j=0;j<pathStack.size();j++){
			simPath.append("/");
			simPath.append(pathStack.get(j));
		}
		return simPath.toString();
    }

c++

string simplifyPath(string path) {
        assert(path[0] =='/');
        vector<string> vec;
        int i =0;
        while(i<path.size()){
            int end = i+1;
            while(end<path.size() && path[end]!='/')
                end++;
            string sub = path.substr(i+1,end-i-1);
            if(sub.length()>0){
            if(sub == ".."){
                if(!vec.empty()) vec.pop_back();
            }
            else if(sub!=".")
                vec.push_back(sub);
        }
        i=end;
        }
        if(vec.empty()) return "/";
    string res;
    for(int i=0;i<vec.size();i++)
        res += "/"+vec[i];
    return res;
    }