zoukankan      html  css  js  c++  java
  • [LeetCode] 71. Simplify Path

    [LeetCode] 71. Simplify Path

    题目

    Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path.

    In a Unix-style file system, a period '.' refers to the current directory, a double period '..' refers to the directory up a level, and any multiple consecutive slashes (i.e. '//') are treated as a single slash '/'. For this problem, any other format of periods such as '...' are treated as file/directory names.

    The canonical path should have the following format:

    The path starts with a single slash '/'.
    Any two directories are separated by a single slash '/'.
    The path does not end with a trailing '/'.
    The path only contains the directories on the path from the root directory to the target file or directory (i.e., no period '.' or double period '..')
    Return the simplified canonical path.

    Example 1:

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

    Example 2:

    Input: path = "/../"
    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: path = "/home//foo/"
    Output: "/home/foo"
    Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.
    

    Example 4:

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

    思路

    栈。还有,string 类型可以与 "" 类型判是否相等。

    读入的时候可以用 stringstream 简化代码:

    stringstream ss;
            ss << path;
            string readcache;
            vector<string> filename;
            while( getline(ss,readcache,'/') ){
            }
    

    代码

    class Solution {
    public:
        string simplifyPath(string path) {
            int n = path.size();
            int i = 0;
            vector<string> stk;
            while (i < n) {
                if (path[i] == '/') {
                    i++;
                    continue;
                }
                string now;
                while (i < n && path[i] != '/') {
                    now += path[i];
                    i++;
                }
                if (now == ".") {
                    continue;
                } else if (now == "..") {
                    if (!stk.empty()) {
                        stk.pop_back();
                    }
                }  else {
                    stk.emplace_back(now);
                }
            }
            string ans;
            for (const auto& t: stk) {
                ans += "/" + t;
            }
            if (ans == "") ans = "/";
            return ans;
    
        }
    };
    
    欢迎转载,转载请注明出处!
  • 相关阅读:
    POJ 2112 Optimal Milking (Dinic + Floyd + 二分)
    POJ 3678 Katu Puzzle (2-SAT)
    超详细的Java面试题总结(一)之Java基础知识篇
    Java高级面试题及答案
    Java线程面试题 Top 50
    Java面试题收集
    Spring基础使用(一)--------IOC、Bean的XML方式装配
    你不知道的Javascript:有趣的setTimeout
    Java 10 的 10 个新特性,将彻底改变你写代码的方式!
    深入理解 Java 多线程核心知识:跳槽面试必备
  • 原文地址:https://www.cnblogs.com/huihao/p/15435119.html
Copyright © 2011-2022 走看看