[Swift]LeetCode838. 推多米诺 | Push Dominoes

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10577534.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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 '.'

---

一行中有 N 张多米诺骨牌，我们将每张多米诺骨牌垂直竖立。

在开始时，我们同时把一些多米诺骨牌向左或向右推。

每过一秒，倒向左边的多米诺骨牌会推动其左侧相邻的多米诺骨牌。

同样地，倒向右边的多米诺骨牌也会推动竖立在其右侧的相邻多米诺骨牌。

如果同时有多米诺骨牌落在一张垂直竖立的多米诺骨牌的两边，由于受力平衡， 该骨牌仍然保持不变。

就这个问题而言，我们会认为正在下降的多米诺骨牌不会对其它正在下降或已经下降的多米诺骨牌施加额外的力。

给定表示初始状态的字符串 "S" 。如果第 i 张多米诺骨牌被推向左边，则 S[i] = 'L'；如果第 i 张多米诺骨牌被推向右边，则 S[i] = 'R'；如果第 i 张多米诺骨牌没有被推动，则 S[i] = '.'。

返回表示最终状态的字符串。

示例 1：

输入：".L.R...LR..L.."
输出："LL.RR.LLRRLL.."

示例 2：

输入："RR.L"
输出："RR.L"
说明：第一张多米诺骨牌没有给第二张施加额外的力。

提示：

1. 0 <= N <= 10^5
2. 表示多米诺骨牌状态的字符串只含有 'L'，'R'; 以及 '.';

---

Runtime: 284 ms

Memory Usage: 20.8 MB

class Solution {
    func pushDominoes(_ dominoes: String) -> String {
        var n:Int = dominoes.count
        var arrChar = Array(dominoes)
        var cnt:[Int] = [Int](repeating:0,count:n)
        for i in 1..<n
        {
            if arrChar[i - 1] == "R" && arrChar[i] == "."
            {
                arrChar[i] = "R"
                cnt[i] = cnt[i - 1] + 1
            }
        }
        var cur:Int = 0
        for i in stride(from:n - 2,through:0,by:-1)
        {
            if arrChar[i + 1] != "L" {continue}
            cur = cnt[i + 1] + 1
            if arrChar[i] == "." || cnt[i] > cur
            {
                arrChar[i] = "L"
                cnt[i] = cur
            }
            else if arrChar[i] == "R" && cnt[i] == cur
            {
                 arrChar[i] = "."
            }            
        }
        return String(arrChar)
    }
}

---

308ms

class Solution {
    func pushDominoes(_ dominoes: String) -> String {
    guard dominoes.count > 1 else{
        return dominoes
    }
    var dominoes = Array(dominoes)
    var startIndex = 0
    var movingIndex = 0

    while movingIndex < dominoes.count{
        if dominoes[startIndex] == "."{
            if dominoes[movingIndex] == "."{
                movingIndex += 1
            }else if dominoes[movingIndex] == "L"{
                pushLeft(dominoes: &dominoes, startIndex: startIndex, endIndex: movingIndex)
                movingIndex += 1
                startIndex = movingIndex
            }else{
                // if dominoes[movingIndex] = right
                startIndex = movingIndex
            }
        }else if dominoes[startIndex] == "L"{
            if dominoes[movingIndex] == "L"{
                if startIndex != movingIndex{
                    pushLeft(dominoes: &dominoes, startIndex: startIndex, endIndex: movingIndex)
                    startIndex = movingIndex
                }
                movingIndex += 1
            }else if dominoes[movingIndex] == "."{
                movingIndex += 1
            }else{
                // now we R
                startIndex = movingIndex
            }
        }else{
            // if dominoes[startIndex] = R
            // then what do we do
            if dominoes[movingIndex] == "R"{
                if startIndex != movingIndex{
                    pushRight(dominoes: &dominoes, startIndex: startIndex, endIndex: movingIndex)
                    startIndex = movingIndex
                }
                movingIndex += 1
            }else if dominoes[movingIndex] == "."{
                movingIndex += 1
            }else{
                // we meet L
                pushRightLeft(dominoes: &dominoes, startIndex: startIndex, endIndex: movingIndex)
                movingIndex += 1
                startIndex = movingIndex
            }
        }
    }
    
    if startIndex < movingIndex && dominoes[startIndex] == "R"{
        while startIndex < movingIndex{
            dominoes[startIndex] = "R"
            startIndex += 1
        }
    }
    
  
    return String(dominoes)
}
func pushLeft(dominoes : inout [Character], startIndex : Int, endIndex : Int){
    guard startIndex >= 0 && endIndex < dominoes.count && startIndex < endIndex else{
        fatalError("Index Not Correct")
    }
    var startIndex = startIndex
    while startIndex < endIndex{
        dominoes[startIndex] = "L"
        startIndex += 1
    }
}

func pushRight(dominoes : inout [Character], startIndex : Int, endIndex : Int){
    guard startIndex >= 0 && endIndex < dominoes.count && startIndex < endIndex else{
        fatalError("Index Not Correct")
    }
    var startIndex = startIndex
    while startIndex < endIndex{
        dominoes[startIndex] = "R"
        startIndex += 1
    }
}

func pushRightLeft(dominoes : inout [Character], startIndex : Int, endIndex : Int){
    guard startIndex >= 0 && endIndex < dominoes.count && startIndex < endIndex else{
        fatalError("Index Not Correct")
    }
    
    var startIndex = startIndex
    var endIndex = endIndex
    while startIndex < endIndex{
        dominoes[startIndex] = "R"
        dominoes[endIndex] = "L"
        startIndex += 1
        endIndex -= 1
    }
  }
}