【leetcode】Valid Parentheses
来源:互联网 发布:vue.js chrome插件 编辑:程序博客网 时间:2024/06/14 03:19
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.
bool isValid(char *s) { const int size = 10000; char stack[size]; int p = 0; for (; *s != '\0'; ++s) { switch (*s) { case ')': if (p == 0 || stack[p - 1] != '(') { return false; } --p; break; case ']': if (p == 0 || stack[p - 1] != '[') { return false; } --p; break; case '}': if (p == 0 || stack[p - 1] != '{') { return false; } --p; break; default: stack[p++] = *s; } // switch } return p == 0;}
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
- oc中不允许方法重载
- 逆序对的求法 归并排序
- Codeforces 296B Yaroslav and Two Strings dp+容斥(入门
- Python函数小结(2)-- 装饰器、 lambda
- android 常用URI 值得记住
- 【leetcode】Valid Parentheses
- Android最佳实践之UI篇(20条UI最佳实践建议)
- 最短路径 Dijkstra算法
- Ansible的第一课:安装它
- sqlmap学习及代码简析
- 第十一讲_项目三_买玫瑰
- Web开发中可以用到的一些在线计算工具(一)
- 【leetcode】Two Sum
- 【Processing学习】Project1