Sync LeetCode submission Runtime - 275 ms (23.36%), Memory - 22.6 MB (57.57%)

Author: jimit105

0868-push-dominoes/README.md

@@ -0,0 +1,42 @@
+<p>There are <code>n</code> 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.</p>
+
+<p>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.</p>
+
+<p>When a vertical domino has dominoes falling on it from both sides, it stays still due to the balance of the forces.</p>
+
+<p>For the purposes of this question, we will consider that a falling domino expends no additional force to a falling or already fallen domino.</p>
+
+<p>You are given a string <code>dominoes</code> representing the initial state where:</p>
+
+<ul>
+	<li><code>dominoes[i] = &#39;L&#39;</code>, if the <code>i<sup>th</sup></code> domino has been pushed to the left,</li>
+	<li><code>dominoes[i] = &#39;R&#39;</code>, if the <code>i<sup>th</sup></code> domino has been pushed to the right, and</li>
+	<li><code>dominoes[i] = &#39;.&#39;</code>, if the <code>i<sup>th</sup></code> domino has not been pushed.</li>
+</ul>
+
+<p>Return <em>a string representing the final state</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> dominoes = &quot;RR.L&quot;
+<strong>Output:</strong> &quot;RR.L&quot;
+<strong>Explanation:</strong> The first domino expends no additional force on the second domino.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/05/18/domino.png" style="height: 196px; width: 512px;" />
+<pre>
+<strong>Input:</strong> dominoes = &quot;.L.R...LR..L..&quot;
+<strong>Output:</strong> &quot;LL.RR.LLRRLL..&quot;
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>n == dominoes.length</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+	<li><code>dominoes[i]</code> is either <code>&#39;L&#39;</code>, <code>&#39;R&#39;</code>, or <code>&#39;.&#39;</code>.</li>
+</ul>

0868-push-dominoes/solution.py

@@ -0,0 +1,35 @@
+# Approach 2: Calculate Force
+
+# Time: O(N)
+
+class Solution:
+    def pushDominoes(self, dominoes: str) -> str:
+        N = len(dominoes)
+        force = [0] * N
+
+        # Left to Right
+        f = 0
+        for i in range(N):
+            if dominoes[i] == 'R':
+                f = N
+            elif dominoes[i] == 'L':
+                f = 0
+            else:
+                f = max(f - 1, 0)
+            force[i] += f
+
+        # Right to Left
+        f = 0
+        for i in range(N - 1, -1, -1):
+            if dominoes[i] == 'L':
+                f = N
+            elif dominoes[i] == 'R':
+                f = 0
+            else:
+                f = max(f - 1, 0)
+            force[i] -= f
+
+        return ''.join('.' if f == 0 
+                            else 'R' if f > 0 
+                            else 'L'
+                        for f in force)