leetcode---Simplify Path---栈

最新推荐文章于 2022-03-28 23:25:43 发布

谛听-

最新推荐文章于 2022-03-28 23:25:43 发布

阅读量357

点赞数

分类专栏：题

本文链接：https://blog.csdn.net/u012319493/article/details/51520194

版权

题专栏收录该内容

456 篇文章 1 订阅

订阅专栏

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

For example,
path = “/home/”, => “/home”
path = “/a/./b/../../c/”, => “/c”

class Solution {
public:
    string simplifyPath(string path) 
    {
        stack<string> s;
        string ans = "";
        int i = 0;
        while(i < path.length())
        {
            while(i<path.length() && path[i] == '/')
                i++;
            string name = "";
            while(i<path.length() && path[i] != '/')
                name += path[i++];
            if(name == ".." && !s.empty())
                s.pop();
            else if(name != "" && name != "." && name != "..")
                s.push(name);
        }
        if(s.empty())
            ans = "/";
        else
        {
            while(!s.empty())
            {
                ans =  "/" + s.top() + ans;
                s.pop();
            }
        }
        return ans;
    }
};