LeetCode Simplify Path
来源:互联网 发布:淘宝贷款利息好高 编辑:程序博客网 时间:2024/05/22 05:05
题目:
Given an absolute path for a file (Unix-style), simplify it.
For example,
path = "/home/"
, => "/home"
path = "/a/./b/../../c/"
, => "/c"
click to show corner cases.
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"
.
class Solution {public:string simplifyPath(string path) {stack<string> t;int n = path.size();int i = 0;while (i < n) {if (path[i] == '/')i++;string s;while (path[i] != '/' && i < n) {s.push_back(path[i]);i++;}if (s == "." || s == "")continue;else if (s == "..") {if (!t.empty())t.pop();}elset.push(s);}if (t.empty())return "/";string ans;while (!t.empty()) {ans = "/" + t.top() + ans;t.pop();}return ans;}};
0 0
- LeetCode: Simplify Path
- LeetCode Simplify Path
- LeetCode : Simplify Path
- [Leetcode] Simplify Path
- [leetcode] simplify path
- [LeetCode] Simplify Path
- leetcode 100: Simplify Path
- [leetcode]Simplify Path
- [LeetCode]Simplify Path
- [leetCode] Simplify Path
- [leetcode]Simplify Path
- [leetcode] Simplify Path
- [LeetCode] Simplify Path
- leetcode simplify path
- Leetcode: Simplify Path
- LeetCode题解:Simplify Path
- [LeetCode] Simplify Path
- LeetCode Simplify Path
- Fork/Join框架小示例-计算连续任意大个数之和
- c语言编写经验逐步积累3
- 魔兽改建程序源码(一)
- 指针自身的地址问题
- C++必知必会(2)
- LeetCode Simplify Path
- 递归转非递归几个实例
- Find all max of elements of an array
- 改变MFC控件背景颜色
- 那村的人儿(村长)第十期数码照片后期处理全套培训教程
- 黑马程序员_java基础——异常及递归
- lua
- 年轻人的浮躁(2)
- c语言编写经验逐步积累4