思路1:使用栈存放前面的字符 遇到#
就退栈
时间复杂度O(m+n):遍历两个字符串
空间复杂度O(m+n):栈
class Solution:
def backspaceCompare(self, S: str, T: str) -> bool:
return self.helper(S)==self.helper(T)
def helper(self,S):
stack = []
for e in S:
if e=='#' and stack: # 栈不空出,栈空时不操作
stack.pop()
elif e!='#':
stack.append(e)
return "".join(stack)