-
Notifications
You must be signed in to change notification settings - Fork 29
/
Copy path0844-Backspace-String-Compare.py
53 lines (40 loc) · 1.35 KB
/
0844-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
'''
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.
Follow up:
Can you solve it in O(N) time and O(1) space?
'''
# Time Complexity: O(n + m)
# Space Complexity: O(1)
class Solution:
def backspaceCompare(self, S: str, T: str) -> bool:
backS, upperS, backT, upperT = 0, len(S) - 1, 0, len(T) - 1
while True:
while upperS >= 0 and (backS or S[upperS] == '#'):
backS += 1 if S[upperS] == '#' else -1
upperS -= 1
while upperT >= 0 and (backT or T[upperT] == '#'):
backT += 1 if T[upperT] == '#' else -1
upperT -= 1
if not (upperS >= 0 and upperT >= 0 and S[upperS] == T[upperT]):
return upperS == upperT == -1
upperS, upperT = upperS - 1, upperT - 1