LeetCode OJ：Simplify Path（简化路径）

 1 class Solution {
 2 public:
 3     string simplifyPath(string path) {
 4         stack<string> tokenStk;
 5         int sz = path.size();
 6         for (int i = 0; i < sz; ++i){
 7             if (path[i] == ‘/‘) continue;
 8             else{
 9                 string tmp = "";
10                 for (int j = i; j < sz && path[j] != ‘/‘; ++j, ++i){
11                     tmp.append(1, path[i]);
12                 }
13                 if (tmp == ".."){
14                     if (!tokenStk.empty())tokenStk.pop();
15                 }
16                 else if (tmp == ".")
17                     continue;
18                 else
19                     tokenStk.push(tmp);
20             }
21         }
22 
23         vector<string> tokenVec;
24         while (!tokenStk.empty()){//存储的是反向的目录，将其输出打vector中，这样比较好
25             tokenVec.push_back(tokenStk.top());
26             tokenStk.pop();
27         }
28         string ret;
29         if (tokenVec.empty()) ret.append(1, ‘/‘);
30         for (int i = tokenVec.size() - 1; i >= 0; --i){
31             ret.append(1, ‘/‘);
32             ret.append(tokenVec[i]);
33         }
34         return  ret;
35     }
36 };