[leetcode] Simplify Path

import java.util.Stack;

public class Solution {
    public String simplifyPath(String path) {
        if (path == null || path.length() == 0)
            return path;
        Stack<String> stack = new Stack<String>();
        String[] oldPaths = path.split("/");
        for (String each : oldPaths) {
            if (each.equals(""))
                continue;
            if (each.equals("."))
                continue;
            if (each.equals("..")) {
                if (!stack.isEmpty())
                    stack.pop();
            } else {
                stack.push(each);
            }

        }
        if (stack.isEmpty())
            return "/";

        StringBuilder sb = new StringBuilder();
        while (!stack.isEmpty()) {
            sb.append(new StringBuffer(stack.pop()).reverse().toString());
            sb.append("/");
        }

        return sb.reverse().toString();
    }

    public static void main(String[] args) {
        System.out.println(new Solution().simplifyPath("/a/./b/../../c/"));
        System.out.println(new Solution().simplifyPath("//a//b//c//"));
        System.out.println(new Solution().simplifyPath("/home/.//aa/.././"));
        System.out.println(new Solution().simplifyPath("/../..//.././/."));

    }
}