71. Simplify Path | Java最短代码实现
来源:互联网 发布:淘宝怎么提现到支付宝 编辑:程序博客网 时间:2024/06/05 07:07
原题链接:71. Simplify Path
欢迎优化!
【思路】
本题考查字符串和栈的基本操作。本身并不难:
public String simplifyPath(String path) { Stack<String> stack = new Stack<String>(); String temp = ""; for (int i = 0; i < path.length(); i++) { while (i < path.length() && path.charAt(i++) == '/') //跳过'/' i++; while (i < path.length() && path.charAt(i) != '/') { //将文件名记录在temp中 temp += path.charAt(i); i++; } if (temp.equals("..") && !stack.isEmpty()) //如果为"..",且栈不空,弹出第一个(返回上一级目录) stack.pop(); else if (!temp.equals(".") && !temp.equals("..") && !temp.equals("")) //入栈 stack.add(temp); temp = ""; } while (!stack.isEmpty()) temp = "/" + stack.pop() + temp; return temp == "" ? "/" : temp; }252 / 252 test cases passed. Runtime: 11 ms Your runtime beats 63.37% of javasubmissions.
欢迎优化!
1 0
- 71. Simplify Path | Java最短代码实现
- (Java)LeetCode-71. Simplify Path
- 【leetcode】71. Simplify Path【java】
- [LeetCode] 71. Simplify Path java
- [leetcode]71. Simplify Path@Java
- 【LeetCode】Simplify Path实现(Java版)
- Rotate List | Java最短代码实现
- 3Sum | Java最短代码实现
- H-Index | Java最短代码实现
- Jump Game | Java最短代码实现
- [Leetcode] Simplify Path (Java)
- Simplify Path (Java)
- [LeetCode][Java] Simplify Path
- LeetCode|Simplify Path-java
- Simplify Path leetcode java
- LeetCode 71. Simplify Path
- LeetCode --- 71. Simplify Path
- [Leetcode] 71. Simplify Path
- C++中的虚函数(一)
- Android Studio添加依赖时出现“Manifest merger failed”
- iOS容易造成循环引用的三种场景,就在你我身边!
- MyEclipse中利用Hibernate反向工程生成Java Web项目的实体类
- C++虚函数与虚函数表
- 71. Simplify Path | Java最短代码实现
- linux 搜索命令
- Byte.parseByte报错java.lang.NumberFormatException: unable to parse '向文件写东西' as integer
- fresh air项目记录3
- C++虚函数及虚函数表解析
- 移动Web开发经验
- python的ggplot库实例
- iOS推送:本地通知UILocalNotification
- HDU5645 DZY Loves Balls 数学