-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathLeetcode20.py
156 lines (141 loc) · 4.99 KB
/
Leetcode20.py
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
# Tf even is this?
# class Solution(object):
# def isValid(self, s):
# def ok(s):
# print(s)
# d = {'(': ')', '{': '}', '[': ']'}
# slice = []
# if len(s) == 0:
# return True
# if s.count('[') == s.count(']') and s.count('{') == s.count('}') and s.count('(') == s.count(')'):
# if s.count('[') + s.count(']') >= s.count('{') + s.count('}') and s.count('[') + s.count(
# ']') >= s.count('(') + s.count(')'):
# most_brackets = (s.count('[') + s.count(']')) // 2
#
# elif s.count('{') + s.count('}') >= s.count('[') + s.count(']') and s.count('{') + s.count(
# '}') >= s.count('(') + s.count(')'):
# most_brackets = (s.count('{') + s.count('}')) // 2
#
# else:
# most_brackets = (s.count('(') + s.count(')')) // 2
#
# for i in range(most_brackets):
# if s[i] == '(' or s[i] == '{' or s[i] == '[':
# slice = s[s.index(s[i]) + 1: s.index(d[s[i]])]
# if s[i] not in slice and len(slice) % 2 != 0:
# return False
# elif s[i] not in slice and len(slice) % 2 == 0:
# if slice.count('[') == slice.count(']') and slice.count('{') == slice.count(
# '}') and slice.count('(') == slice.count(')'):
# s = s[:s.index(s[i])] + s[s.index(d[s[i]]):]
# if len(s) == i + 1:
# return True
#
# else:
# return False
#
# else:
# slice = slice.replace(s[i], '')
# print(slice)
# if len(slice) == 0:
# return True
# elif len(slice) % 2 == 1:
# return False
# else:
# if slice.count('[') == slice.count(']') and slice.count('{') == slice.count(
# '}') and slice.count('(') == slice.count(')'):
# ok(slice)
# else:
# return False
# return False
#
# else:
# return False
# ok(s)
#
#
# a = Solution()
# print(a.isValid('()[[{(})]]'))
# Wrong
# class Solution(object):
# def isValid(self, s):
# d = {'(': ')', '{': '}', '[': ']'}
#
# if s.count('[') == s.count(']') and s.count('{') == s.count('}') and s.count('(') == s.count(')'):
# for i in range(len(s)-1):
# if s[i] in d.keys():
# if s[i + 1] != d[s[i]] and any(s[i + 1] in value for value in d.values()):
# return False
# else:
# continue
# return True
# else:
# return False
#
#
# a = Solution()
# print(a.isValid('({())}'))
# Correct solution
# class Solution(object):
# def isValid(self, s):
# d = {'(': ')', '{': '}', '[': ']'}
# temp = s + '/'
# result = 0
#
# if s.count('[') == s.count(']') and s.count('{') == s.count('}') and s.count('(') == s.count(')'):
# for i in range(len(s)//2):
# for k in range(len(temp)):
# if temp[k] in d.keys():
# if temp[k + 1] == d[temp[k]]:
# temp = temp[:k] + temp[k + 2:]
# print(temp)
# result = 1
# break
# else:
# result = 0
# continue
#
# if result == 0:
# return False
#
# return True
#
# else:
# return False
#
#
# a = Solution()
# print(a.isValid('({)}'))
# Shortest method
# class Solution(object):
# def isValid(self, s):
# d = {'(': ')', '{': '}', '[': ']'}
# temp = []
# for i in s:
# if i in d.keys():
# temp.append(i)
# elif temp != [] and i == d[temp[-1]]:
# temp.pop()
# else:
# return False
# return temp == []
#
# a = Solution()
# print(a.isValid('{{)}'))
#My shortest method
class Solution():
def isvalid(self, s):
d = {"(": ")", "{": "}", "[": "]"}
temp = []
for i in s:
if i in d.keys():
temp.append(i)
elif temp and d[temp[-1]] == i:
temp.pop()
else:
return False
if temp:
return False
return True
a = Solution()
print(a.isvalid("[([]])"))