leetcode Valid Parentheses
来源:互联网 发布:淘宝店铺怎么找回 编辑:程序博客网 时间:2024/06/06 02:41
题目:
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.
利用一个栈保存左边的符号,遇到匹配的右符号就将栈顶弹出,最后检测栈是否为空。
代码:
public boolean isValid(String s) { Stack<Character> symbol = new Stack<Character>(); for (int i = 0; i < s.length(); i++) { if (s.charAt(i) == '(' || s.charAt(i) == '[' || s.charAt(i) == '{') symbol.push(s.charAt(i)); else { if (symbol.isEmpty()) return false; char top = symbol.peek(); if ((top == '(' && s.charAt(i) != ')') || (top == '[' && s.charAt(i) != ']') || (top == '{' && s.charAt(i) != '}')) { return false; } symbol.pop(); } } return symbol.isEmpty(); }
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
- 一个帖子无法打开的bug的排除
- Linux C unit_test 单元测试
- 笔记之MessageFormat.format(-----) ——字符串模版替换的方法
- 几大最短路径算法比较
- No package php-mcrypt available.
- leetcode Valid Parentheses
- 互斥锁pthread_mutex_t的使用
- c++中 的向量vector
- HDU ACM 1799 循环多少次?
- 8 String to Integer (atoi)
- 基础练习 十六进制转八进制
- 水晶苍蝇拍(13):不同阶段的企业不同的估值
- mac 安装 virtualbox 虚拟xp系统
- 粒子滤波(PF:Particle Filter)目标跟踪