[Leetcode] Valid Parentheses
来源：互联网 发布：作业调度算法 编辑：程序博客网 时间：2024/06/05 16:33
题目：
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) { stack<char> record; for (int i = 0; i < (int)s.size(); ++i) { if (s[i] == '(' || s[i] == '[' || s[i] == '{') { record.push(s[i]); } else { if (record.empty()) return false; if (s[i] == ')' && record.top() == '(') record.pop(); else if (s[i] == ']' && record.top() == '[') record.pop(); else if (s[i] == '}' && record.top() == '{') record.pop(); else return false; //unknown character } } return record.empty(); }};总结：复杂度O(n).
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
- 索引的几种访问方法-续(SKIP SCAN)
- Oracle Flashback技术总结
- 在oracle中where 子句和having子句中的区别
- Where are you from? 你会怎么回答？[摘自沪江英语网]
- Leetcode--Maximum Product Subarray
- [Leetcode] Valid Parentheses
- MySQL学习笔记
- [树莓派内核学习]u-boot移植-barebox
- SCN
- 汪丁丁：互联与深思（第三届新媒体变革系列论坛第一期）
- SOJ 2309: In the Army Now 树状数组求逆序对
- UVA 10673 - Play with Floor and Ceil （扩展欧几里得求方程的解）
- 25匹马的角逐
- 创建控制文件resetlogs和noresetlogs的区别
