[Leetcode] 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:
//({()}
    /*algorithm
        using stack, compare current char with stack top element
        if pair, continue, otherwise, if it's left char, push, otherwise, stop 
    *///()
    //() ()[]{} (]  ([)]
    #define isleft(c) (c == '(' || c == '[' || c == '{')
    bool isValid(string s) {
         if(s.size() < 1)return true;
         stack<char>stk;
         unordered_map<char,char>table={{'(',')'},
                                        {'[',']'},
                                        {'{','}'}};
        int i = 0;
        while(i < s.size()){
            if(stk.empty() || isleft(s[i]))
                stk.push(s[i]);
            else if(s[i] == table[stk.top()]){
                stk.pop();
            }else{
                break;
            }
            ++i;
        }
        
        return stk.empty(); 
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值