71. Simplify Path
来源:互联网 发布:中国闪存技术知乎 编辑:程序博客网 时间:2024/06/06 01:24
分析:需要注意的是/…可以表示名字为…的路径,路径的最后可能没有/。可以利用栈,碰到正常路径压入栈中,碰到/.不作任何操作,碰到/..删除栈顶元素。下面代码中用数组来模拟栈。代码如下:
class Solution {public: string simplifyPath(string path) { int len = path.size(); vector<string> vec; int i = 0, index = 0; while(i < len) { int j = path.find("/", i+1); //从字符串path下标i+1处开始,查找字符'/' ,返回下标。也可以写为"/"。 string tmp; if(j != string::npos) //没有查找到 tmp = path.substr(i, j - i); else {tmp = path.substr(i, len); j = len;} if(tmp == "/"); else if(tmp == "/."); else if(tmp == "/..") {if(!vec.empty())vec.pop_back();} else vec.push_back(tmp); i = j; } if(vec.empty())return "/"; else { string res; for(int i = 0; i < vec.size(); i++) res += vec[i]; return res; } }};
0 0
- LeetCode 71. Simplify Path
- LeetCode --- 71. Simplify Path
- [Leetcode] 71. Simplify Path
- [leetcode] 71.Simplify Path
- 71.Simplify Path
- 71.Simplify Path
- 71. Simplify Path
- [leetcode] 71.Simplify Path
- 71. Simplify Path
- Leetcode 71. Simplify Path
- LeetCode 71. Simplify Path
- Leetcode 71. Simplify Path
- 71. Simplify Path LeetCode
- 71. Simplify Path
- 71. Simplify Path
- 71. Simplify Path
- 71. Simplify Path
- leetcode 71. Simplify Path
- const关键字详解
- 平面设计入门之快速选择工具
- Jquery绑定事件(bind和live的区别)
- 字符串反转,但单词不倒置
- 杭电acm 1009 FatMouse' Trade 比较典型的贪心问题
- 71. Simplify Path
- objective C程序 内存管理
- 2015年8月2日工作日志--------赵鑫
- 编译并使用Boost库(Win7+Boost1.53+VS2012)
- 移植u-boot-2015.07-rc3之修改代码支持DM9000网卡(七)
- Ubuntu Kylin15.04 DVD .VOB 格式文件播放
- 求一个字符串中【连续】出现次数最多的子串
- OC相关-02:oc和c的基本差异
- mysql常用命令