/**
1431 · Push Dominoes
Algorithms
Medium
Accepted Rate
60%
DescriptionSolutionNotesDiscussLeaderboard
Description
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.
0 <= N <= 10^5
String dominoes contains only ‘L’, ‘R’ and ‘.’
Example
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.
Tags
Company
Google
https://www.cnblogs.com/grandyang/p/10393508.html
https://www.lintcode.com/problem/1431/
*/
/**
* @param dominoes: a string
* @return: a string representing the final state
*/
func pushDominoes (dominoes string) string {
// Write your code here
var res string = ""
dominoes = "L" + dominoes + "R"
var i int = 0
for j := 1; j < len(dominoes); j++ {
if string(dominoes[j]) == "." {
continue;
}
var mid int = j - i - 1
if i > 0 {
res += string(dominoes[i])
}
if dominoes[i] == dominoes[j] {
res += buildSameCharStrByNum(mid, string(dominoes[i]))
} else if string(dominoes[i]) == "L" && string(dominoes[j]) == "R" {
res += buildSameCharStrByNum(mid, ".")
} else {
res += buildSameCharStrByNum(mid / 2, "R") + buildSameCharStrByNum(mid % 2, ".") + buildSameCharStrByNum(mid / 2, "L")
}
i = j
}
return res
}
func buildSameCharStrByNum(n int, s string) string {
var res string = ""
for i := 0; i < n; i++ {
res += s
}
return res
}