LeetCode (Valid Parentheses)

来源：互联网发布：js数组字符串方法编辑：程序博客网时间：2024/05/31 18:39

Problem:

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.

Solution:

class Solution {public:    bool isValid(string s) {        stack<char> res;        for (int i = 0; i < s.size(); i++){            if (s[i] == '(')                res.push(')');            else if (s[i] == '{')                res.push('}');            else if (s[i] == '[')                res.push(']');            else if (res.empty()||res.top() != s[i])                return false;            else                res.pop();        }        return res.empty();    }};

0 0

LeetCode: Valid Parentheses
LeetCode: Longest Valid Parentheses
LeetCode: Valid Parentheses
LeetCode Longest Valid Parentheses
[Leetcode] Valid Parentheses
LeetCode: Longest Valid Parentheses
[Leetcode] Longest Valid Parentheses
LeetCode : Valid Parentheses
[leetcode]longest Valid Parentheses(!!)
Leetcode: Valid Parentheses
leetcode 52: valid parentheses
[Leetcode] Longest Valid Parentheses
leetcode Longest Valid Parentheses
【leetcode】Valid Parentheses
【leetcode】Longest Valid Parentheses
[LeetCode]Longest Valid Parentheses
[LeetCode]Valid Parentheses
LeetCode-Valid Parentheses
python爬虫神器PyQuery的使用方法
Java可见性之内存模型
POJ3264-Balanced Lineup
maven project jar
MySQL 的 RowNum 实现
LeetCode (Valid Parentheses)
TensorFLow能够识别的图像文件，可以通过numpy
python时间,日期,时间戳处理
eclipse 创建maven web项目
linux kernel 笔记（二）
判断一年是否是闰年
ZigBee读取PanID
sizeof 陷阱
mxnet第二个例子-neural-style