-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbackspace-string-compare.py
executable file
·95 lines (75 loc) · 1.84 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
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
# -*- coding: utf-8 -*-
"""
Created on Thu Apr 9 13:53:59 2020
@author: johnoyegbite
"""
# SOLVED!
"""
Problem:
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?
"""
# def compress(S): # O(1) space
# s = 0
# num_back_space = 0
# idx = len(S)-1
# while idx >= 0:
# if S[idx] != "#":
# if num_back_space == 0:
# s += ord(S[idx])
# else:
# num_back_space -= 1
# else:
# num_back_space += 1
# idx -= 1
# return s
def compress(S): # O(n) space
stack = []
for s in S:
if s == "#":
if len(stack):
stack.pop()
else:
stack.append(s)
return stack
def backspaceCompare(S, T):
"""
:type S: str
:type T: str
:rtype: bool
"""
return compress(S) == compress(T)
if __name__ == "__main__":
S = "ab##"
T = "c#d#"
S = "a##c"
T = "#a#c"
S = "ab#c"
T = "ad#c"
S = "a#c"
T = "b"
S = "ab#c#c"
T = "cb#a#a"
print(backspaceCompare(S, T))