问题描述:
Given an absolute path for a file (Unix-style), simplify it.
示例:
path = "/home/"
, => "/home"
path = "/a/./b/../../c/"
, => "/c"
问题分析:
将/ 和 / 之间的字符串分割出来,"." 可以直接忽略,每出现一个".."字串,根据规则选择保留它或者是删掉前一个分割出来的字串。最后利用栈求解即可。
过程详见代码:
class Solution {
public:
string simplifyPath(string path) {
string res ="/";
for (int i = 0; i < path.length(); i++)
{
if (path[i] == '/')
{
path[i] = ' ';
}
}
stringstream ss(path);
string temp;
stack<string> stc;
int count = 0;
while (ss >> temp)
{
if (temp != ".")
{
if (!stc.empty())
{
if (temp == "..")
{
string top = stc.top();
if (top == "..")
{
stc.push(temp);
}
else
{
stc.pop();
}
}
else stc.push(temp);
}
else if (temp != "..") stc.push(temp);
}
}
stack<string> st;
while (!stc.empty())
{
st.push(stc.top());
stc.pop();
}
while (!st.empty())
{
res.append(st.top());
res.push_back('/');
st.pop();
}
if (res != "/")
res.pop_back();
return res;
}
};