-
Notifications
You must be signed in to change notification settings - Fork 0
/
E.BackspaceString
29 lines (29 loc) · 978 Bytes
/
E.BackspaceString
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
#yet to write optimized sol
class Solution:
def backspaceCompare(self, s: str, t: str) -> bool:
match1 = []
match2 = []
for i in range(len(s)):
match1.append(s[i])
if s[i]=="#" and match1!=["#"]:
print(s, match1,"c")
match1.pop()
print("wtf",match1)
match1.pop()
for j in range(len(t)):
match2.append(t[j])
if t[j]=="#" and match2!=["#"]:
match2.pop()
match2.pop()
#match1 = [match1.remove("#") if "#" in match1]
#match2 = [match2.remove("#") if "#" in match2]
if "#" in match1:
match1.remove("#")
if "#" in match2:
match2.remove("#")
print(match2,match1, "what")
#a = set(match1) & set(match2)
if (match1) != (match2): # and len(list(a)==len(match1)) :
return False
else :
return True