码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode-71-Simplify Path

时间:2019-01-30 20:54:47      阅读:170      评论:0      收藏:0      [点我收藏+]

标签:tor   str   stack   trail   name   names   exp   bsp   root   

算法描述:

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 shortest string 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//b////c/d//././/.."
Output: "/a/b/c"

解题思路:路径之类的题目,一般都用stack去求解。这个问题需要知道stringstream类和getline方法。

    string simplifyPath(string path) {
        string temp;
        stack<string> stk;
        stringstream ss(path);
        while(getline(ss,temp,/)){
            if(temp == "." || temp =="") continue;
            else if(temp == ".." && !stk.empty()) stk.pop();
            else if(temp != "..") stk.push(temp);
        }
        string results;
        while(!stk.empty()){
            results = "/" + stk.top() + results;
            stk.pop();
        }
        return results.empty() ? "/" : results;
    }

 

LeetCode-71-Simplify Path

标签:tor   str   stack   trail   name   names   exp   bsp   root   

原文地址:https://www.cnblogs.com/nobodywang/p/10339713.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!