leetcode 844. Backspace String Compare

class Solution {
    public boolean backspaceCompare(String S, String T) {
        char[] s = S.toCharArray();
        char[] t = T.toCharArray();
        String res1="",res2="";
        for(int i=0;i<s.length;i++){
            if(s[i]!='#'){
                res1 += s[i];
            }else{
                if(res1.length()==0) continue;
                res1 = res1.substring(0,res1.length()-1);
            }
        }
        for(int i=0;i<t.length;i++){
            if(t[i]!='#'){
                res2 += t[i];
            }else{
                if(res2.length()==0) continue;
                res2 = res2.substring(0,res2.length()-1);
            }
        }
        return res1.equals(res2);
    }
}

恩恩，想了想这个用栈结构也挺不错的，一看到字符串，脑袋就被局限住了，吃饭吃饭~