LEETCODE: Simplify Path

最新推荐文章于 2025-11-30 20:35:27 发布

原创最新推荐文章于 2025-11-30 20:35:27 发布 · 257 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LEETCODE #算法 #string #目录

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文深入探讨了如何将Unix风格的绝对路径进行简化的过程，详细解释了'.（当前目录）'和'..（上一级目录）'符号的作用，并通过C++代码实例展示了实现路径简化的步骤。

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

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

汗！不熟悉linux啊，'.'是当前目录，‘..’是到上一级目录。其他的都没有特殊含义。

class Solution {
public:
    string simplifyPath(string path) {
        stack<string> words;
        path += '/';
        string current;
        for(int ii = 0; ii < path.length(); ii ++) {
            if(path[ii] != '/') {
                current += path[ii];
            }
            else {
                if(current.length() == 1 && current[0] == '.') {
                    current.clear();
                    continue;
                }
                
                if(current.length() == 2 && current[0] == '.' && current[1] == '.') {
                    if(!words.empty()) {
                        words.pop();
                    }
                    current.clear();
                    continue;
                }
                
                if(!current.empty()) {
                    words.push(current);
                    current.clear();
                    continue;
                }
            }
        }
        
        string result;
        while(!words.empty()) {
            result = '/' + result;
            result = words.top() + result;
            words.pop();
        }
        
        if(!result.empty()) {
            result = result.substr(0, result.length() - 1);
        }
        
        result = "/" + result;
        
        return result;
    }
};