leetcode:字符串之Simplify Path
题目:
Given an absolute path for a file (Unix-style), simplify it.
For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"
Corner Cases:
• Did you consider the case where path = "/../"? In this case, you should return "/".
• Another corner case is the path might contain multiple slashes '/' together, such as
"/home//foo/". In this case, you should ignore redundant slashes and return "/home/foo".
即:去掉给定的路径名中间无用的字符,返回最简形式。
C++实现:
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
string simplifyPath(string const& path)
{
vector<string> dirs; // 当做栈
for (auto i = path.begin(); i != path.end();)
{
++i;
auto j = find(i, path.end(), '/');
auto dir = string(i, j);
if (!dir.empty() && dir != ".") // 当有连续'///' 时,dir 为空
{
if (dir == "..")
{
if (!dirs.empty())
dirs.pop_back();
}
else
dirs.push_back(dir);
}
i = j;
}
stringstream out;
if (dirs.empty())
{
out << "/";
}
else
{
for (auto dir : dirs)
out << '/' << dir;
}
return out.str();
}
int main()
{
string paths1="/home/";
string paths2 = "/a/./b/../../c/";
string sPath1,sPath2;
sPath1=simplifyPath(paths1);
sPath2=simplifyPath(paths2);
cout<<sPath1<<endl;
cout<<sPath2<<endl;
return 0;
}
测试结果;