Input:
S =
"ab#c"
, T =
"ad#c"
Output:
true
Explanation
: Both S and T become "ac".
Input:
S =
"ab##"
, T =
"c#d#"
Output:
true
Explanation
: Both S and T become "".
Input:
S =
"a##c"
, T =
"#a#c"
Output:
true
Explanation
: Both S and T become "c".
Input:
S =
"a#c"
, T =
"b"
Output:
false
Explanation
: S becomes "c" while T becomes "b".
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:
return self.getChar(S) == self.getChar(T)
def getChar(self, S: str) -> str:
stack = []
for i in S:
if stack and i == '#':
stack.pop()
elif i.isalpha():
stack.append(i)
return ''.join(stack)