Simplify Path

 1 class Solution {
 2 public:
 3     string simplifyPath(string path) {
 4     vector<string> s;
 5     string name;
 6     const char *p = path.c_str();
 7     while (*p != ‘\0‘)
 8     {
 9         while (*p == ‘/‘)                   //去除多余的/
10             p++;
11         while (*p != ‘/‘ && *p !=‘\0‘)      //分段，用name储存
12         {
13             name.push_back(*p++);
14         }
15         if (name[0] == ‘\0‘)                //是否是结尾，结尾则不处理
16             ;
17         else if (name.compare("..") == 0)   //判断是否有上一级目录，有则返回上一级目录
18         {
19             if (s.size() > 0)
20                 s.erase(s.end());
21         }
22         else if (name.compare(".") != 0)    //当前目录.不用处理，否则加入到vector中
23         {
24             s.push_back(name);
25         }
26         name.erase(0);
27     }
28     string ret;
29     if (s.size() == 0)                      //特殊情况/
30         return "/";
31     vector<string>::iterator it;
32     for(it=s.begin(); it!=s.end(); it++){
33         ret += "/";
34         ret += *it;
35     }
36     return ret;
37     }
38 };