2022-3-19 Leetcode 71. 简化路径

weixin_51187533

已于 2022-07-19 10:48:37 修改

阅读量128

点赞数

分类专栏：力扣刷题记录文章标签： leetcode

于 2022-03-19 12:00:51 首次发布

本文链接：https://blog.csdn.net/weixin_51187533/article/details/123591248

版权

C++ 字符串处理路径简化算法优化双端队列

关键词由CSDN通过智能技术生成

力扣刷题记录专栏收录该内容

273 篇文章 0 订阅

订阅专栏

在这里插入图片描述

第一版

class Solution {
public:
    string simplifyPath(string path) {
        vector<string> mysk;
        string ret;
        int i = 0;
        int len = path.size();
        while(i < len){
            int count = 0;
            int alpha = 0;
            string word;
            while(i < len && path[i] == '.'){
                count++;
                i++;
            }
            if(count == 2){
                if(!mysk.empty())
                mysk.pop_back();
            }else if(count > 2){
                mysk.push_back(string(count,'.'));
            }
            while(isalpha(path[i]) || path[i] == '_'){
                alpha++;
                i++;
            }
            word = path.substr(i-alpha,alpha);
            if(!word.empty())
            mysk.push_back(word);
            i++;
        }
        if(mysk.empty()){
            return "/";
        }
        for(i = 0;i < mysk.size();i++){
            ret += ("/" +mysk[i]);
        }
        return ret;
    }
};

在这里插入图片描述
第二版

class Solution {
public:
    string simplifyPath(string path) {
        vector<string> mysk;
        string ret;
        int i = 0;
        int len = path.size();
        while(i < len){
            int count = 0;
            int alpha = 0;
            string word;
            while(i < len && path[i] == '.'){
                count++;
                i++;
            }
            if(count == 2 && (i == len || path[i] == '/')&& i > 2 && path[i-3] == '/'){
                if(!mysk.empty())
                mysk.pop_back();
            }else if(count > 2 && path[i] == '/'){
                mysk.push_back(string(count,'.'));
            }else if(count == 1 && (i == len || path[i] == '/')){

            }else {
                word += string(count,'.');
            }
            
            while(isalpha(path[i]) || path[i] == '_'){
                alpha++;
                i++;
            }
            word += path.substr(i-alpha,alpha);
            if(!word.empty())
            mysk.push_back(word);
            i++;
        }
        if(mysk.empty()){
            return "/";
        }
        for(i = 0;i < mysk.size();i++){
            ret += ("/" +mysk[i]);
        }
        return ret;
    }
};

第三版

class Solution {
public:
    string simplifyPath(string path) {
        vector<string> mysk;
        string ret;
        while(!path.empty()){
            string word;
            int cur = path.find('/');
            if(cur == string::npos){
                word = path;
            }
            word = path.substr(0,cur);
            if(word == "."){
                word = "";
          //  }else if(word == ".." && !mysk.empty()){
            }else if(word == ".."){
                if(!mysk.empty())
                mysk.pop_back();
                word = "";
            }else if(!word.empty()){
                mysk.push_back(word);
            }
            path.erase(0,cur+1);
            if(cur == string::npos)
            break;
        }
        if(mysk.empty()){
            return "/";
        }
        for(int i = 0;i < mysk.size();i++){
            ret += ('/' + mysk[i]);
        }
        return ret;
    }
};

2022-7-19的一版

class Solution {
public:
    string simplifyPath(string path) {
        deque<string> m_stack;
        int i = 0; 
        int len = path.size();
        for (; i < len; i++){
            while (i < len && path[i] == '/') i++;
            int j = i;
            while (j < len && path[j] != '/') j++;
            string str = path.substr(i, j - i);
            if (str == ".."){
                if (!m_stack.empty())
                m_stack.pop_back();
            } else if (str != "" && str != "."){
                m_stack.push_back(str);
            }
            i = j;
        }
        string ans;
        while (!m_stack.empty()){
            ans += '/';
            string str = m_stack.front();
            m_stack.pop_front();
            ans += str;
        }
        return ans == "" ? "/" : ans;
    }
};