LeetCode OJ 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".
class Solution {
public:
    string simplifyPath(string path) {
        vector<string> fileName;
        for (int i = 0; i < path.size(); i++) {
            if (path[i] == '/') {
                if (i < path.size() - 1 && path[i + 1] == '/') {  // situation for "//"
                    i += 1 - 1;
                    continue;
                }
                if ((i == path.size() - 2 && path[i + 1] == '.') || (i < path.size() - 2 && path[i + 1] == '.' && path[i + 2] == '/')) {  // situation for "/."
                    i += 2 - 1;
                    continue;
                }
                if ((i == path.size() - 3 && path[i + 1] == '.' && path[i + 2] == '.') || (i < path.size() - 3 && path[i + 1] == '.' && path[i + 2] == '.' && path[i + 3] == '/')) {  // situation for "/.."
                    i += 3 - 1;
                    if (fileName.size() > 0) {
                        fileName.pop_back();    
                    }
                    continue;
                }
                string name;  // if the situation is not above, it is a valid file name
                int j = i + 1;
                for (; j < path.size() && path[j] != '/'; j++) {
                    name.push_back(path[j]);
                }
                if (name.size() != 0) fileName.push_back(name);
                i = j - 1;
                continue;
            }
        }
        string ans;
        for (int i = 0; i < fileName.size(); i++) {
            ans += "/" + fileName[i];
        }
        if (ans.size() == 0) ans = "/";
        return ans;
    }
};


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值