https://leetcode.com/problems/valid-parentheses/
来源:互联网 发布:淘宝联盟的钱返到哪里 编辑:程序博客网 时间:2024/05/22 01:39
https://leetcode.com/problems/valid-parentheses/
也是堆栈
左括号全部入栈 如果遇到任何一种右括号
弹出一个元素 如果匹配 就继续
如果不匹配 就直接return False
当结束时 栈应该是空的
如果不为空 说明多很多做括号 也要False
class Solution: # @param {string} s # @return {boolean} def isValid(self, s): left=['(','{','['] right=[')','}',']'] list=[] for i in s: if i in left: list.append(i) else: if list==[]: return False elif i==')': if list[-1]=='(': list.pop(-1) else: return False elif i=='}': if list[-1]=='{': list.pop(-1) else: return False else:#i==']': if list[-1]=='[': list.pop(-1) else: return False if len(list)==0: return True else: return False
0 0
- https://leetcode.com/problems/valid-parentheses/
- https://leetcode.com/problems/longest-valid-parentheses/
- https://leetcode.com/problems/valid-sudoku/
- https://leetcode.com/problems/valid-palindrome/
- https://leetcode.com/problems/candy/
- https://leetcode.com/problems/sqrtx/
- http://oj.leetcode.com/problems/valid-number/
- https://oj.leetcode.com/problems/majority-element/
- https://leetcode.com/problems/longest-common-prefix/
- https://leetcode.com/problems/pascals-triangle/
- https://leetcode.com/problems/powx-n/
- https://leetcode.com/problems/reverse-integer/
- https://leetcode.com/problems/plus-one/
- https://leetcode.com/problems/unique-paths/
- https://leetcode.com/problems/palindrome-number/
- https://leetcode.com/problems/permutation-sequence/
- https://leetcode.com/problems/climbing-stairs/
- https://leetcode.com/problems/divide-two-integers/
- 面试题:删除一个目录下的所有文件,但保留一个指定文件
- 函数基本模板
- 龙之沙漏游戏工作室
- Android高仿微信头像裁剪
- lintcode:Rotate Image Show result
- https://leetcode.com/problems/valid-parentheses/
- 自我技术总结
- 什么是SEO,它的的核心,目标和方法
- Android SDK 国内镜像
- 素数槽
- Java面试--Spring技术要点--Spring注解
- Kafka安全机制的最新进展
- [IT]图解TCP-IP协议
- IO笔记