Leetcode71. Simplify Path

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

For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"
path = "/a/../../b/../c//.//", => "/c"
path = "/a//bc/d//././/..", => "/a/b/c"

In a UNIX-style file system, a period ('.') refers to the current directory, so it can be ignored in a simplified path. Additionally, a double period ("..") moves up a directory, so it cancels out whatever the last directory was. For more information, look here: https://en.wikipedia.org/wiki/Path_(computing)#Unix_style

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

解法:遇到/直接跳过,只看//之间 的东西,放到栈里面,小心边界条件,最后不加/的那一种("/aaaa//bbbbcdddd/d//././/..") 

class Solution {
public:
    string simplifyPath(string path)
    {
        string ans="";
        vector<string> ans_reverse;
        string temp="";
        stack<string> sta;
        for(auto x:path)//遍历所有字符
        {
            if(x=='/')//记住改成转义意符
            {
                if(temp.size()==0)// 缓存字符串啥也没有 没用的“\”
                {
                    continue;
                }
                else//temp有东西 判断temp不同三种情况 最后temp清空
                {
                    if(temp==".")
                    {
                        
                    }
                    else if(temp=="..")
                    {
                        if(!sta.empty())sta.pop();
                    }
                    else
                    {
                        sta.push(temp);
                       // std::cout<<temp<<std::endl;
                    }
                    temp="";
                }
            }
            else
            {
                temp=temp+x;
                //std::cout<<temp<<std::endl;
            }
        }
        if(temp!="")
        {
            if(temp==".")
            {
                
            }
            else if(temp=="..")
            {
                if(!sta.empty())sta.pop();
            }
            else
            {
                sta.push(temp);
                // std::cout<<temp<<std::endl;
            }
        }
        while (!sta.empty())
        {
            ans_reverse.push_back(sta.top());
            sta.pop();
        }
        if(ans_reverse.size()==0) return"/";
        for(int i=ans_reverse.size()-1;i>=0;i--)
        {
            ans=ans+"/"+ans_reverse[i];
            //std::cout<<ans_reverse[i]<<std::endl;
        }
        std::cout<<ans<<std::endl;
        return ans;
    }
};

 

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值