leetcode Simplify Path题解

题目描述:

Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.

In a UNIX-style file system, a period . refers to the current directory. Furthermore, a double period .. moves the directory up a level. For more information, see: Absolute path vs relative path in Linux/Unix

Note that the returned canonical path must always begin with a slash /, and there must be only a single slash / between two directory names. The last directory name (if it exists) must not end with a trailing /. Also, the canonical path must be the shorteststring representing the absolute path.

 

Example 1:

Input: "/home/"
Output: "/home"
Explanation: Note that there is no trailing slash after the last directory name.

Example 2:

Input: "/../"
Output: "/"
Explanation: Going one level up from the root directory is a no-op, as the root level is the highest level you can go.

Example 3:

Input: "/home//foo/"
Output: "/home/foo"
Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.

Example 4:

Input: "/a/./b/../../c/"
Output: "/c"

Example 5:

Input: "/a/../../b/../c//.//"
Output: "/c"

Example 6:

Input: "/a//bc/d//././/.."
Output: "/a/b/c"

中文理解:

给定一串字符串代表unix目录,给出最终的简单表示目录。

解题思路:

使用队列来辅助进行存储,如果当前//中间是".."则将队列上一个元素移除,如果不是".",则将这个//中间的目录存入队列,最后遍历队列,得到所有的目录简单表示。

代码(java):

class Solution {
    public String simplifyPath(String path) {
        Deque<String> queue = new LinkedList<>();
        StringBuilder directory = new StringBuilder();
        for(int i = 0; i <= path.length(); i++) {
            char c = i < path.length() ? path.charAt(i) : '/';
            if(c == '/') {
                String str = directory.toString();
                if(str.equals("..")) {
                    if(!queue.isEmpty()) queue.pollLast();
                } else if(!str.isEmpty()) {
                    if(!str.equals(".")) {
                        queue.offer(str);
                    }
                }
                directory = new StringBuilder();
            } else {
                directory.append(c);
            }
        }
        StringBuilder result = new StringBuilder("/");
        while(!queue.isEmpty()) {
            result.append(queue.poll());
            if(!queue.isEmpty()) {
                result.append("/");
            }
        }
        
        return result.toString();
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值