leetcode/Algorithms/CPP/71.cpp at master · Accagain2014/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
// Author :  Accagain
// Date   :  17/3/30
// Email  :  chenmaosen0@gmail.com

/***************************************************************************************
 *
 * Given an absolute path for a file (Unix-style), simplify it.
 *
 * For example,
 *
 * path = "/home/", => "/home"
 * path = "/a/./b/../../c/", => "/c"
 *
 * 做法：
 *
 * 时间复杂度：
 *
 *
****************************************************************************************/

#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <vector>

#define INF 0x3fffffff

using namespace std;

class Solution {
public:

    string simplifyPath(string path) {
        vector<string> mys;
        string now = "";
        if(path[path.size()-1] != '/')
            path = path + "/";
        for(int i=1; i<path.size(); i++)
        {
            if(path[i] == '/')
            {
                //printf(":::%s\n", now.c_str());
                if(now == "..")
                {
                    if(!mys.empty())
                        mys.erase(mys.end()-1);
                }
                else if(now != "." && now != "")
                    mys.push_back(now);
                now = "";
            }
            else
                now = now + path.substr(i, 1);
        }
        string ans = "";
        for(int i=0; i<mys.size(); i++)
            ans = ans + "/" + mys[i];
        if(ans == "")
            ans = "/";
        return ans;
    }
};

int main() {
    Solution *test = new Solution();
    int data[] = {};
    vector<int> x(data, data + sizeof(data) / sizeof(data[0]));
    printf("%s\n", test->simplifyPath("/...").c_str());
    return 0;
}

//
// Created by cms on 17/3/30.
//