leetcode: Simplify Path

最新推荐文章于 2018-08-26 12:01:31 发布

原创最新推荐文章于 2018-08-26 12:01:31 发布 · 796 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

leetcode

230 篇文章

订阅专栏

本文深入探讨了Unix风格路径的简化算法，通过实例演示了如何精简路径表达，并提供了相应的C/C++解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<string> dirVector;
        
        char *pChar = &path[0];
        
        while (*pChar != '\0')
        {
            if (*pChar == '/')
            {
                while (*pChar == '/')
                    pChar++;
                    
                if (*pChar != '\0')
                {
                    string curDir;
                    while (*pChar != '/' && *pChar != '\0')
                    {
                        curDir += *pChar++;
                    }
                    
                    if (curDir.compare(".") == 0)
                    {
                        continue;
                    }
                    else if (curDir.compare("..") == 0)
                    {
                        if (!dirVector.empty())
                            dirVector.pop_back();
                    }
                    else
                    {
                        dirVector.push_back(curDir);
                    }
                }
            }
        }
        
        string retString("/");
        
        int dirSize = dirVector.size();
        for (int i = 0; i < dirSize; i++)
        {
            retString += dirVector[i];
            
            if (i != dirSize-1)
                retString += "/";
        } 
        return retString;    
    }
};