首页 > 代码库 > [Leetcode] Simplify Path
[Leetcode] Simplify Path
Given an absolute path for a file (Unix-style), simplify it.
For example,
path = "/home/"
, => "/home"
path = "/a/./b/../../c/"
, => "/c"
click to show corner cases.
Corner Cases:
- Did you consider the case where path =
"/../"
?
In this case, you should return"/"
. - Another corner case is the path might contain multiple slashes
‘/‘
together, such as"/home//foo/"
.
In this case, you should ignore redundant slashes and return"/home/foo"
.
Solution:
考察Java String的split function。
- 先用/来split string
- 然后看每一小段,若是”.”或者是“”(说明两个/连着),不入栈;若是”..”,pop;若是正常,push.
1 public class Solution { 2 public String simplifyPath(String path) { 3 if(path==null||path.length()==0) 4 return ""; 5 if(path.equals("/")) 6 return "/"; 7 String[] tokens=path.split("/"); 8 Stack<String> stack=new Stack<String>(); 9 10 for(int i=0;i<tokens.length;++i){11 if(tokens[i].equals("..")){12 if(!stack.empty())13 stack.pop();14 else15 continue;16 }else if(tokens[i].equals(".")||tokens[i].length()==0){17 continue;18 }else{19 stack.push(tokens[i]);20 }21 }22 23 Stack<String> stack2=new Stack<String>();24 String result=new String("");25 26 if(stack.empty())27 return "/";28 29 while(!stack.empty())30 stack2.push(stack.pop());31 while(!stack2.empty()){32 result+="/";33 result+=stack2.pop();34 }35 return result; 36 }37 }
[Leetcode] Simplify Path
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。