zoukankan      html  css  js  c++  java
  • 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.

    You are given a string dominoes representing the initial state where:

    • dominoes[i] = 'L', if the ith domino has been pushed to the left,
    • dominoes[i] = 'R', if the ith domino has been pushed to the right, and
    • dominoes[i] = '.', if the ith domino has not been pushed.

    Return a string representing the final state.

    Example 1:

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

    Example 2:

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

    Constraints:

    • n == dominoes.length
    • 1 <= n <= 105
    • dominoes[i] is either 'L''R', or '.'.
    class Solution {
     public String pushDominoes(String dominoes) {
            char[] a = dominoes.toCharArray();
            int L = -1, R = -1;//positions of last seen L and R
            for (int i = 0; i < dominoes.length(); i++) {
                if (a[i] == 'R') {
                    if (R > L)//R..R, turn all to R
                        while (++R < i)
                            a[R] = 'R';
                    R = i;
                } else if (a[i] == 'L')
                    if (L > R || (R == -1 && L == -1))//L..L, turn all to L
                        while (++L < i)
                            a[L] = 'L';
                    else { //R...L
                        L = i;
                        int lo = R + 1, hi = L - 1;
                        while (lo < hi) { //one in the middle stays '.'
                            a[lo++] = 'R';
                            a[hi--] = 'L';
                        }
                    }
            }
            // R...
            if(R > L) {
                while(R < dominoes.length()) a[R++] = 'R';
            }
            return new String(a);
        }
    }

    https://leetcode.com/problems/push-dominoes/discuss/132482/Java-one-pass-in-place-13ms

  • 相关阅读:
    洛谷 P1005 矩阵取数游戏 (区间dp+高精度)
    洛谷 P1026 统计单词个数 (分组+子串预处理)(分组型dp再次总结)
    洛谷 P1052 过河 (离散化+dp)
    洛谷 P1541 乌龟棋 (四维费用背包)
    洛谷 P1736 创意吃鱼法
    矩阵旋转模板
    洛谷 P1855 榨取kkksc03 (二维费用背包)
    洛谷 P1417 烹调方案 (01背包拓展)
    关于结构体的PPT
    子进程自父进程继承什么或未继承什么
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/15042336.html
Copyright © 2011-2022 走看看