엔지니어 게시판
LeetCode 솔루션 분류

[9/27] 838. Push Dominoes

작성자 정보

  • 학부유학생 작성
  • 작성일

컨텐츠 정보

본문

Medium
2828173Add to ListShare

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 '.'.
Accepted
99,402
Submissions
174,314
태그

관련자료

댓글 1

학부유학생님의 댓글

  • 작성일
Runtime: 229 ms, faster than 95.58% of Python3 online submissions for Push Dominoes.
Memory Usage: 15.3 MB, less than 98.37% of Python3 online submissions for Push Dominoes.
class Solution:
    def pushDominoes(self, dominoes: str) -> str:
        dominoes = "L" + dominoes + "R"
        prev_idx = 0
        ans = ""
        
        for i in range(1, len(dominoes)):
            dom_num = i - prev_idx - 1
            if dominoes[i] == ".": continue
                
            if dominoes[i] == dominoes[prev_idx]:
                ans += dominoes[i] * dom_num
            elif dominoes[i] == "L" and dominoes[prev_idx] == "R":
                m, d = divmod(dom_num, 2)
                ans += "R"*m + "."*d + "L"*m
            else:
                ans += "." * dom_num
                
            
            prev_idx = i
            ans += dominoes[i]
        
        return ans[:-1]
            
            
        
전체 307 / 1 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


알림 0