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 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//bc/d//././/…”
Output: “/a/b/c”

解析:
通过栈模拟目录返回

class Solution {
    public String simplifyPath(String path) {
         Stack<String> dirs = new Stack<>();

        for (int i = 0; i < path.length();) {
            ++i;

            int j = path.indexOf('/', i);
            if (j < 0) j = path.length();
            final String dir = path.substring(i, j);

            // 当有连续 '///'时,dir 为空
            if (!dir.isEmpty() && !dir.equals(".")) {
                if (dir.equals("..")) {
                    if (!dirs.isEmpty())
                        dirs.pop();
                } else {
                    dirs.push(dir);
                }
            }

            i = j;
        }

        StringBuilder result = new StringBuilder();
        if (dirs.isEmpty()) {
            result.append('/');
        } else {
            for (final String dir : dirs) {
                result.append('/').append(dir);
            }
        }
        return result.toString();
    }
}
根据提供的引用内容,可以看出simplifyPath函数是一个C++函数,用于简化给定的路径。该函数使用了塌边法进行三角面片简化,使得复杂模型可以Mesh得到简化。下面是一个简单的C++示例代码: ```c++ #include <iostream> #include <vector> #include <sstream> using namespace std; class Solution { public: string simplifyPath(string path) { string ans, group; vector<string> strs; stringstream ss(path); while (getline(ss, group, '/')) { if (group == "" || group == ".") continue; if (group == ".." && strs.size()) strs.pop_back(); else if (group != "..") strs.push_back(group); } for (string& str : strs) ans += "/" + str; return ans.size() ? ans : "/"; } }; int main() { Solution s; string path = "/a/./b/../../c/"; cout << s.simplifyPath(path) << endl; // 输出:/c return 0; } ``` 上述代码中,我们首先定义了一个Solution类,其中包含了一个simplifyPath函数。该函数接受一个字符串类型的参数path,表示需要简化的路径。在函数内部,我们首先定义了三个变量:ans、group和strs。其中,ans用于存储简化后的路径,group用于存储每个路径段,strs用于存储所有非"."和".."的路径段。 接下来,我们使用stringstream将path按照"/"进行分割,并将每个路径段存储到group中。如果group为空或者为".",则直接跳过;如果group为"..",则将strs中最后一个路径段弹出;否则,将group存储到strs中。 最后,我们遍历strs中的所有路径段,并将它们拼接成一个新的路径ans。如果ans不为空,则返回ans;否则,返回根路径"/"。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值