20. Valid Parentheses \ 71. Simplify Path

本文介绍两种常见算法:括号匹配验证与Unix文件路径简化。括号匹配验证算法通过栈结构检查括号是否正确闭合;路径简化算法则利用栈特性去除无效路径组件,得到规范化的绝对路径。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

20. Valid Parentheses

题目描述

括号匹配:

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.

代码实现

class Solution {
public:
    bool isValid(string s) {
        int s_len = s.size();
        stack<char> tmp;

        for(int i = 0; i < s_len; i++) {
            if(s[i] == '(' || s[i] == '{' || s[i] == '[') {
                tmp.push(s[i]);        
            }
            else {
                if(tmp.empty()) return false;

                char t = tmp.top();
                tmp.pop();

                if(s[i] == ')' && t != '(') return false;
                if(s[i] == ']' && t != '[') return false;
                if(s[i] == '}' && t != '{') return false;
            }
        }

        return tmp.empty()?true:false;
    }
};
class Solution {
public:
    bool isValid(string s) {
        stack<char> paren;
        for (char& c : s) {
            switch (c) {
                case '(': 
                case '{': 
                case '[': paren.push(c); break;
                case ')': if (paren.empty() || paren.top()!='(') return false; else paren.pop(); break;
                case '}': if (paren.empty() || paren.top()!='{') return false; else paren.pop(); break;
                case ']': if (paren.empty() || paren.top()!='[') return false; else paren.pop(); break;
                default: ; // pass
            }
        }
        return paren.empty() ;
    }
};

71. Simplify Path

题目描述

Given an absolute path for a file (Unix-style), simplify it.

For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"
click to show corner cases.

Corner Cases:
Did you consider the case where path = "/../"?
In this case, you should return "/".
Another corner case is the path might contain multiple slashes '/' together, such as "/home//foo/".
In this case, you should ignore redundant slashes and return "/home/foo".

代码实现

class Solution {
public:
    string simplifyPath(string path) {
        string res, tmp;
        vector<string> stk;
        stringstream ss(path);
        while(getline(ss,tmp,'/')) {
            if (tmp == "" || tmp == ".") continue;
            if (tmp == ".." && !stk.empty()) stk.pop_back();
            else if (tmp != "..") stk.push_back(tmp);
            cout << tmp << endl;
        }
        for(auto str : stk) res += "/"+str;
        return res.empty() ? "/" : res;
    }
};
class Solution {
public:
    string simplifyPath(string path) {
        string result="", token;
        stringstream ss(path);
        vector<string> tokens;
        while(getline(ss, token, '/')){
            if(token=="." || token=="") continue;
            else if(token==".."){
                if(tokens.size())  tokens.pop_back();
            }
            else tokens.push_back(token);
        }
        if(!tokens.size()) return "/";
        for(int i=0; i<tokens.size(); ++i)
            result += '/' + tokens[i];
        return result;
    }
};

在这里需要注意的是我们使用了stringstream和getline的用法来切割字符串。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值