[LeetCode] 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 <= S.length <= 200
1 <= T.length <= 200
S and T only contain lowercase letters and ‘#’ characters.

给两个字符串，字符串中的#代表退格，遇到退格就删除前面一个有效字符，经过处理之后比较两个字符是否相等。
由于退格符号作用于最近的一个有效字符，因此可以使用栈存储string的每一个有效字符，当遍历到一个# 并且栈非空的时候就从栈顶pop出一个元素，遇到有效字符则直接入栈。最后比较两个栈中的字符是否完全相等。

C++ 实现

class Solution {
public:
    bool backspaceCompare(string S, string T) {
        stack<char> s, t;
        // 将string按照上述策略应用到stack 的匿名函数
        const auto apply_2_stack = [] (const string& str, stack<char>& s)
        {
            for (const char c : str)
            {
                if (c == '#')
                {
                    if (s.size())
                    {
                        s.pop();
                    }
                }
                else
                {
                    s.push(c);
                }
            }
        };
        // 分别应用S, T
        apply_2_stack(S, s);
        apply_2_stack(T, t);

        return s == t;
    }
};