LeetCode 838 Push Dominoes

LeetCode 838 Push Dominoes

传送门

题目分析

There are N dominoes in a line, and we place each domino vertically upright.

In the beginning, we simultaneously push some of the dominoes either to the left or to the right.

After each second, each domino that is falling to the left pushes the adjacent domino on the left.

Similarly, the dominoes falling to the right push their adjacent dominoes standing on the right.

When a vertical domino has dominoes falling on it from both sides, it stays still due to the balance of the forces.

For the purposes of this question, we will consider that a falling domino expends no additional force to a falling or already fallen domino.

Given a string “S” representing the initial state. S[i] = 'L', if the i-th domino has been pushed to the left; S[i] = 'R', if the i-th domino has been pushed to the right; S[i] = '.', if the i-th domino has not been pushed.

Return a string representing the final state.

Example 1:

Input: ".L.R...LR..L.."
Output: "LL.RR.LLRRLL.."

Example 2:

Input: "RR.L"
Output: "RR.L"
Explanation: The first domino expends no additional force on the second domino.

Note:

1. 0 <= N <= 10^5
2. String dominoes contains only 'L‘, 'R' and '.'

题目可以说是很简单了，输入一个字符串代表多米诺骨牌，输出推倒后的骨牌排列。

思考

按理说这个的解决方法就是一遍一遍的模拟，我的方法是使用两个字符串，每次旧的字符串不动，新的字符串进行修改，两端的需要特殊对待，修改的规则如下：

1. 当前骨牌在九骨牌中必须为.。
2. 旧骨牌中当前左右分别为R, L时当前骨牌不会倒。
3. 旧骨牌中左侧为R时此骨牌修改为R。
4. 骨牌中右侧为L时此骨牌修改为L。

定义停止迭代的条件为is_end，当没有骨牌被修改时is_end设置为true。

最后返回修改后的字符串即可。

代码实现

class Solution {
public:
    string pushDominoes(string dominoes) {
        // 多米诺骨牌推倒，好有趣的样子
        if (dominoes.length() <= 1) {
            return dominoes;
        }
        bool is_end = false;
        int len = dominoes.length();
        string old_str = dominoes;
        string new_str = dominoes;
        while (!is_end) {
            is_end = true;
            if (old_str[0] == '.') {
                new_str[0] = (old_str[1] == 'L' ? 'L' : '.');
            }
            for (int i = 1; i < len - 1; ++i) {
                if (old_str[i] == '.') {
                    if (old_str[i - 1] != 'R' || old_str[i + 1] != 'L') {
                        if (old_str[i - 1] == 'R') {
                            new_str[i] = 'R';
                            is_end = false;
                        }
                        else if (old_str[i + 1] == 'L') {
                            new_str[i] = 'L';
                            is_end = false;
                        }
                    }

                }
            }
            if (old_str[len - 1] == '.') {
                new_str[len - 1] = (old_str[len - 2] == 'R' ? 'R' : new_str[len - 1]);
            }
            old_str = new_str;
        }
        return old_str;// old_str和new_str时一样的
    }
};

感想

直接模拟行为。