leetcode 71 Simplify Path
2016-06-19 22:25
351 查看
leetcode 71 Simplify Path
原题链接:https://leetcode.com/problems/simplify-path/Description
Given an absolute path for a file (Unix-style), simplify it.For example,
path = “/home/”, => “/home”
path = “/a/./b/../../c/”, => “/c”
Solution
简化linux文件路径,”.”代表当前目录,”..”代表上级目录大体做法:先把path按’/’符分割保存起来(由于c++ string没有split函数,自己写一个吧)
再把切割后的字符串扫一遍即可。
具体如下
class Solution { public: string simplifyPath(string path) { string ans; if(path.empty()) return ans; auto split = [=](char sep = '/')->vector<string> { string temp; vector<string> res; size_t start = 0, end = 0; while((end = path.find(sep, start)) != string::npos) { temp = path.substr(start, end - start); if(temp != "") res.emplace_back(temp); start = end + 1; } temp = path.substr(start); if(temp != "") res.emplace_back(temp); return res; }; vector<string> res = split(); vector<string> stk; for(auto &r: res) { if(r ==".") continue; else if(r == "..") { if(!stk.empty()) stk.pop_back(); } else { stk.push_back(r); } } if(stk.empty()) { ans.push_back('/'); } else { for(auto &r: stk) { ans.push_back('/'); ans += r; } } return ans; } };
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解