【leetcode】【medium】71. Simplify Path

230 篇文章 0 订阅

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

题目链接:https://leetcode-cn.com/problems/simplify-path/

思路

使用栈,捋清逻辑即可。

几个编程要点:

1)c++中没有split函数,可以曲线实现split,或者逐字符判断。

2)临时存储的string需要清空。

易错样例:

1)"/home":不以"/"结尾,需要在结束对path的遍历后,查看末尾的地址是否需要存入栈。

2)"/home//file/":"//"和"/./"的处理方式其实是一样的,属于同一情况可合并判断。

class Solution {
public:
    string simplifyPath(string path) {
        if(path.empty()) return "";
        stack<string> record;
        string tmp;
        for(auto c: path){
            if(c=='/'){
                if(tmp==".." && record.size()>0){
                    record.pop();
                }else if(!tmp.empty() && tmp!="." && tmp!=".."){
                    record.push(tmp);
                }
                tmp.clear();
            }else{
                tmp+=c;
            }
        }
        if(!tmp.empty()){
            if(tmp==".." && record.size()>0)record.pop();
            else if(tmp!="." && tmp!="..") record.push(tmp);
        }
        if(record.size()<=0) return "/";
        tmp.clear();
        while(!record.empty()){
            tmp = "/" + record.top() + tmp;
            record.pop();
        }
        return tmp;
    }
};

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值