844. Backspace String Compare

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. 1 <= S.length <= 200
2. 1 <= T.length <= 200
3. S and T only contain lowercase letters and '#' characters.

Follow up:

• Can you solve it in O(N) time and O(1) space?

题意：给出两个字符串S,T。字符串由字母和"#"组成，"#"能够使前一个有效字母失效。问经过处理后，两个字符串是否相等。

class Solution {
public:
    bool backspaceCompare(string S, string T) {
        stack<char>st1,st2;
        for(int i=0;i<S.length();i++){
            if(S[i]=='#'&&st1.size()>0){
                st1.pop();
            }else if(S[i]!='#'){
                st1.push(S[i]);
            }
        }
        for(int i=0;i<T.length();i++){
            if(T[i]=='#'&&st2.size()>0){
                st2.pop();
            }else if(T[i]!='#'){
                st2.push(T[i]);
            }
        }
        //看清所有的样例，考虑所有情况
        if(st1.size()==st2.size()){
            while(!st1.empty()&&(st1.top()==st2.top())){
                st1.pop();
                st2.pop();
            }
            if(st1.empty()&&st2.empty())
                return 1;
            else
                return 0;
        }
        return 0;
    }
};