首页 > 代码库 > [LeetCode]71 Simplify Path
[LeetCode]71 Simplify Path
https://oj.leetcode.com/problems/simplify-path/
http://blog.csdn.net/linhuanmars/article/details/23972563
public class Solution { public String simplifyPath(String path) { if (path == null) return null; String[] paths = path.split("/"); Stack<String> stack = new Stack<>(); for (String p : paths) { if (p.equals(".") || p.isEmpty()) { continue; } if (p.equals("..")) { if (!stack.empty()) stack.pop(); } else { stack.push(p); } } if (stack.empty()) return "/"; // No path StringBuilder sb = new StringBuilder(); while (!stack.empty()) { sb.insert(0, "/" + stack.pop()); } return sb.toString(); } }
[LeetCode]71 Simplify Path
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。