LeetCode——Simplify Path

最新推荐文章于 2021-08-23 16:31:02 发布

sanfendi

最新推荐文章于 2021-08-23 16:31:02 发布

阅读量2k

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/laozhaokun/article/details/41317153

版权

leetcode 专栏收录该内容

119 篇文章

订阅专栏

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".

原题链接：https://oj.leetcode.com/problems/simplify-path/

用一个栈来顺序存储比较方便。

public class SimplifyPath {
	public static void main(String[] args) {
		String ret = new SimplifyPath().simplifyPath("/a/./b/../../c/");
		System.out.println("result:"+ret);
	}
	public String simplifyPath(String path) {
		String[] params = path.split("/");
		Stack<String> stack = new Stack<String>();
		for(String param : params){
			if(param.equals(".."))
				stack.pop();
			else if(!param.equals("..") && !param.equals(".") && !param.equals(""))
				stack.push(param);
		}
		StringBuilder builder = new StringBuilder();
		for(String str :stack)
			builder.append("/"+str);
		return stack.isEmpty() ? "/":builder.toString();
	}
}