-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path20_Valid_Parentheses.py
More file actions
54 lines (45 loc) · 1.2 KB
/
Copy path20_Valid_Parentheses.py
File metadata and controls
54 lines (45 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
"""
https://leetcode.com/problems/valid-parentheses/
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Note that an empty string is also considered valid.
Example 1:
Input: "()"
Output: true
Example 2:
Input: "()[]{}"
Output: true
Example 3:
Input: "(]"
Output: false
Example 4:
Input: "([)]"
Output: false
Example 5:
Input: "{[]}"
Output: true
"""
#stack
class Solution:
def isValid(self, s: 'str') -> 'bool':
d = {'(':')', '[':']', '{': '}'}
stack = []
if s=='':
return True
for i in range(len(s)):
if s[i] in ['(', '[', '{']:
stack.append(s[i])
elif s[i] in [')', ']', '}']:
if len(stack)==0:
return False
t = stack.pop()
if d[t]!=s[i]:
return False
if len(stack)==0:
return True
else:
return False
x = Solution()
print(x.isValid("()[]"))