-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbackspacedCompare.py
54 lines (39 loc) · 1.28 KB
/
backspacedCompare.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
# Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character.
# Note that after backspacing an empty text, the text will continue empty.
# 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 = "b"
# Output: false
# Explanation: s becomes "c" while t becomes "b".
# Constraints:
# 1 <= s.length, 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?
class Solution(object):
def backspaceCompare(self, s, t):
"""
:type s: str
:type t: str
:rtype: bool
"""
s_backspaced =[]
t_backspaced =[]
for i in range(len(s)):
if s[i] == '#':
if s_backspaced:
s_backspaced.pop()
else:
s_backspaced.append(s[i])
for i in range(len(t)):
if t[i] == '#':
if t_backspaced:
t_backspaced.pop()
else:
t_backspaced.append(t[i])