# 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）R….R  ->  RRRRRR

2）L….L  ->  LLLLLL

3）L….R  ->  L….R

4）R….L  -> RRRLLL   or   R…..L  ->  RRR.LLL

``````class Solution {
public:
string pushDominoes(string dominoes) {
string res = "";
dominoes = "L" + dominoes + "R";
for (int i = 0, j = 1; j < dominoes.size(); ++j) {
if (dominoes[j] == '.') continue;
int mid = j - i - 1;
if (i > 0) res += dominoes[i];
if (dominoes[i] == dominoes[j]) res += string(mid, dominoes[i]);
else if (dominoes[i] == 'L' && dominoes[j] == 'R') res += string(mid, '.');
else res += string(mid / 2, 'R') + string(mid % 2, '.') + string(mid / 2, 'L');
i = j;
}
return res;
}
};
``````

``````.L.R...LR..L..
.L.RRRRLRRRL..
00001230012000
``````

``````LL.RR.LLRRLL..
10001210011000
``````

``````class Solution {
public:
string pushDominoes(string dominoes) {
int n = dominoes.size();
vector<int> cnt(n);
for (int i = 1; i < n; ++i) {
if (dominoes[i - 1] == 'R' && dominoes[i] == '.') {
dominoes[i] = 'R';
cnt[i] = cnt[i - 1] + 1;
}
}
for (int i = n - 2, cur = 0; i >= 0; --i) {
if (dominoes[i + 1] != 'L') continue;
cur = cnt[i + 1] + 1;
if (dominoes[i] == '.' || cnt[i] > cur) {
dominoes[i] = 'L';
cnt[i] = cur;
} else if (dominoes[i] == 'R' && cnt[i] == cur) {
dominoes[i] = '.';
}
}
return dominoes;
}
};
``````

Shortest Distance to a Character

https://leetcode.com/problems/push-dominoes/

https://leetcode.com/problems/push-dominoes/discuss/132332/C%2B%2BJavaPython-Two-Pointers

https://leetcode.com/problems/push-dominoes/discuss/132932/C%2B%2B-2-pass-scan-O(2N)-13ms

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation