LeetCode刷题笔记:有效的括号

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

An input string is valid if:

  • Open brackets must be closed by the same type of brackets.
  • Open brackets must be closed in the correct order.

Note that an empty string is also considered valid.

Example 1:

Input: "()"
Output: true

Example 2:

Input: "()[]{}"
Output: true

Example 3:

Input: "(]"
Output: false

Example 4:

Input: "([)]"
Output: false

Example 5:

Input: "([)]"
Output: false

解题思路

使用栈来保存读入的每一个括号字符,若遇到栈顶与下一个字符是否匹配,若匹配则弹出栈顶元素,否则将下一个字符入栈,遍历字符结束后看栈内是否还有元素,若没有则是正确,否则错误

Solution

class Solution {
public:
    bool isValid(string s) {
        int size = s.length();
        if(size == 0) return true;
        stack<char> container;
        container.push(s[0]);
        for(int i = 1; i < size; ++i) {
            if(!container.empty()) {
                if(container.top() == '(' && s[i] == ')') {
                    container.pop();
                }else if(container.top() == '{' && s[i] == '}'){
                    container.pop();
                }else if(container.top() == '[' && s[i] == ']') {
                    container.pop();
                }else {
                    container.push(s[i]);
                }
            }else {
                container.push(s[i]);
            }
        }
        if(container.empty()) {
            return true;
        }else {
            return false;
        }
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值