#71 Simplify Path

Description

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.

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 shortest string representing the absolute path.

Examples

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”

解题思路

解读一下题目,就是simplify路径,以“/”为开头,不能有多个"/“连续,碰到”.“和”…"的时候按照路径进行回溯

那么其实就是栈,先以"/“进行分词,分完后在碰到”“和”.“时,直接跳过,碰到”…"时候pop弹出,碰到其他的时候push弹入

代码

class Solution {
    public String simplifyPath(String path) {
        String[] root = path.split("/");
        List<String> way = new ArrayList<>();
        int i = 0;
        for(i = 0; i < root.length; i++){
            if(root[i].length() == 0 || root[i].equals("."))
                continue;
            if(root[i].equals("..")){
                if(way.size() != 0)
                    way.remove(way.size() - 1);
                continue;
            }
            way.add(root[i]);
        }
        String answer = "";
        for(i = 0; i < way.size(); i++){
            answer += "/";
            answer += way.get(i);
        }
        if(answer.length() == 0)
            return "/";
        return answer;
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值