71. Simplify Path（stack）

最新推荐文章于 2021-01-27 06:01:52 发布

Chihyung

最新推荐文章于 2021-01-27 06:01:52 发布

阅读量164

点赞数

本文链接：https://blog.csdn.net/u011539372/article/details/52644040

版权

Leetcode 同时被 2 个专栏收录

48 篇文章 0 订阅

订阅专栏

stack

1 篇文章 0 订阅

订阅专栏

题目：

Given an absolute path for a file (Unix-style), simplify it.

For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"

简化路径，规则：

..返回一级目录

.无效

运用stack记录路径

public class Solution {
    public String simplifyPath(String path) {
        String res = "";
        Stack stack =  new Stack<String>();
        String temp="";
        for(int i=1;i<=path.length();i++)
        {
        	if(path.length()!=i &&path.charAt(i) != '/'){
        		temp+=path.charAt(i);
        	}
        	else
        	{
        		if (temp.equals("..") && !stack.isEmpty())
        		{
        			stack.pop();
        			
        		}
        		if(!temp.equals(".") && !temp.equals("..") && !temp.equals(""))
        		{
        			stack.push(temp);
        			
        		}
        		temp="";
        	}
        	
        }

    	if(stack.isEmpty())return "/";
    	
    	while(!stack.isEmpty())
    	{
    		res="/"+stack.pop()+res;
    	}
    	return res;
    }
}