Leetcode 71. Simplify Path

14 篇文章 0 订阅
7 篇文章 0 订阅

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".

网址是被"/"隔开,对于网址的分析可以见这篇博客

http://www.cnblogs.com/springfor/p/3869666.html

如果遇见了"."或者分割的字符串为空,则跳过这个字符串,如果遇到“..”,然后就进行弹出堆栈的操作

code

public class Solution {
    public String simplifyPath(String path) {
        if(path == null || path.length() == 0)
            return path;
        Stack<String>stack = new Stack<String>();
        String[] temRes = path.split("/");
        for(int i = 0; i < temRes.length; i++){
            if(temRes[i].equals(".") || temRes[i].length() == 0) 
                continue;
            else if(temRes[i].equals("..")){
                if(!stack.isEmpty()){
                    stack.pop();
                }
            }
            else{
                stack.push(temRes[i]);
            }
        }
        //I use two stack to reverse the make the order of the string the same with the original string
        Stack<String> reverse = new Stack<String>();
        StringBuffer result = new StringBuffer();
        while(!stack.isEmpty()){
            reverse.push(stack.pop());
        }
        while(!reverse.isEmpty()){
            result.append("/" + reverse.pop());
        }
        if(result.length() == 0)
            result.append("/");
        return result.toString();
    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值