Runtime: 81 ms (Top 96.77%) | Memory: 56.70 MB (Top 74.19%)

Author: AnasImloul

scripts/algorithms/P/Push Dominoes/Push Dominoes.js

@@ -1,55 +1,20 @@
-/**
- * @param {string} dominoes
- * @return {string}
- */
+// Runtime: 81 ms (Top 96.77%) | Memory: 56.70 MB (Top 74.19%)
+
 var pushDominoes = function(dominoes) {
-    
-    let len = dominoes.length;
-    let fall = [];
-    let force = 0;
-    let answer = "";
-    
-    // Traverse from left to right. Focus on the dominoes falling to the right
-    for (let i = 0; i < len; i++) {
-        if (dominoes[i] == 'R') {
-            force = len;
-        } else if (dominoes[i] == 'L') {
-            force = 0;
-        } else {
-            force = Math.max(force-1,0);
-        }
-        fall[i] = force;
+    let l=0, r=1;
+    const arr = ("L"+dominoes+"R").split("");
+    while(l<arr.length-1){
+        while(arr[r]=='.') 
+            r++;
+        if(arr[l]==arr[r]) 
+            for(let i=l+1; i<r; i++) 
+                arr[i]=arr[l];
+        if(arr[l]>arr[r]) 
+            for(let i=1; i<=(r-l-1)/2; i++){
+                arr[l+i] = 'R';
+                arr[r-i] = 'L';
+            }   
+        l=r++;
     }
-    
-    //console.log('fall array 1: ', fall);
-    
-    // Traverse from right to left. Focus on the dominoes falling to the left
-    // Subtract the value from the values above
-    for (let i = len-1; i >= 0; i--) {
-        if (dominoes[i] == 'L') {
-            force = len;
-        } else if (dominoes[i] == 'R') {
-            force = 0;
-        } else {
-            force = Math.max(force-1,0);
-        }
-        fall[i] -= force;
-    }    
-    
-    //console.log('fall array 2: ', fall);
-    
-    // Just traverse through the fall[] array and assign the values in the answer string accordingly
-    for (let i = 0; i < len; i++) {
-        if (fall[i] < 0)
-            answer += 'L';
-        else if (fall[i] > 0 )
-            answer += 'R';
-        else
-            answer += '.';
-    }
-    
-    //console.log('answer: ', answer);
-    
-    return answer;
-    
+    return arr.slice(1,arr.length-1).join("");
 };