首页 > 代码库 > simplify-path
simplify-path
https://leetcode.com/problems/simplify-path/
https://leetcode.com/mockinterview/session/result/xjl3d3m/
现在字符串比较,都知道用 equals了,哈哈。不能用==,否则可能有bug。
package com.company; import java.util.*; class Solution { public String simplifyPath(String path) { Stack<String> stk= new Stack<>(); String[] strs = path.split("/"); for (int i=0; i<strs.length; i++) { if (strs[i].equals("") || strs[i].equals(".")) { continue; } else if (strs[i].equals("..")) { if (!stk.empty()) { stk.pop(); } } else { stk.push(strs[i]); } } Stack<String> newStk= new Stack<>(); String tmp; while (!stk.empty()) { tmp = stk.pop(); newStk.push(tmp); } StringBuilder sb = new StringBuilder(); while (!newStk.empty()) { sb.append("/" + newStk.pop()); } String str = sb.toString(); if (str.equals("")) { str = "/"; } return str; } } public class Main { public static void main(String[] args) throws InterruptedException { System.out.println("Hello!"); Solution solution = new Solution(); // Your Codec object will be instantiated and called as such: String path = "/a/./b/../../c/"; String ret = solution.simplifyPath(path); System.out.printf("ret:%s\n", ret); System.out.println(); } }
simplify-path
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。