-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsecondweek_second.py
61 lines (47 loc) · 1.41 KB
/
secondweek_second.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
# Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character.
# Example 1:
# Input: S = "ab#c", T = "ad#c"
# Output: true
# Explanation: Both S and T become "ac"
# Example 2:
# Input: S = "ab##", T = "c#d#"
# Output: true
# Explanation: Both S and T become "".
# Example 3:
# Input: S = "a##c", T = "#a#c"
# Output: true
# Explanation: Both S and T become "c".
# Example 4:
# Input: S = "a#c", T = "b"
# Output: false
# Explanation: S becomes "c" while T becomes "b".
# Note:
# 1 <= S.length <= 200
# 1 <= T.length <= 200
# S and T only contain lowercase letters and '#' characters.
class Solution:
def backspaceCompare(self, S: str, T: str) -> bool:
S = list(S)
T = list(T)
counter_S = []
counter_T = []
for i in range(len(S)):
if(S[i] == '#'):
if(len(counter_S) == 0):
continue;
else:
counter_S.pop()
else:
counter_S.append(S[i])
for i in range(len(T)):
if(T[i] == '#'):
if(len(counter_T) == 0):
continue;
else:
counter_T.pop()
else:
counter_T.append(T[i])
if(counter_S == counter_T):
return True
else:
return False