-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBackspace String Compare.py
59 lines (48 loc) · 1.35 KB
/
Backspace String Compare.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
'''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 "".
'''
# My solution
class Solution:
def backspaceCompare(self, S: str, T: str) -> bool:
left, right = [], []
count = 0
for i in reversed(S):
if i == "#":
count += 1
continue
elif count > 0:
count -= 1
continue
else:
left.append(i)
count = 0
for i in reversed(T):
if i == "#":
count += 1
continue
elif count > 0:
count -= 1
continue
else:
right.append(i)
return (left == right)
# O(N) O(1) space solution
class Solution(object):
def backspaceCompare(self, S, T):
def F(S):
skip = 0
for x in reversed(S):
if x == '#':
skip += 1
elif skip:
skip -= 1
else:
yield x
return all(x == y for x, y in itertools.izip_longest(F(S), F(T)))