✨ [1187] Make Array Strictly Increasing

Author: enkr1

1187/my_solution.js

@@ -0,0 +1,77 @@
+/**
+ * @param {number[]} arr1
+ * @param {number[]} arr2
+ * @return {number}
+ */
+const makeArrayIncreasing = (arr1, arr2) => {
+  console.log(arr1)
+  console.log(arr2)
+
+  //   let sortedArr2 = [], firstPartOfArr2 = arr2.slice(0, Math.ceil(arr2.length / 2)), secondPartOfArr2 = arr2.slice(Math.ceil(arr2.length / 2));
+  //   console.log(firstPartOfArr2)
+  //   console.log(secondPartOfArr2)
+  //   console.log(arr2)
+  //
+  //   while (0 < firstPartOfArr2.length || 0 < secondPartOfArr2.length) {
+  //     if (0 === firstPartOfArr2.length && 0 === secondPartOfArr2.length) break;
+  //
+  //     if (0 < firstPartOfArr2.length && firstPartOfArr2[0] < secondPartOfArr2[0]) {
+  //       sortedArr2.push(firstPartOfArr2.shift());
+  //     }
+  //   }
+  let count = 0, tmpPrev = null;
+  for (let i = 0; i < arr1.length; i++) {
+    let prev = arr1[i - 1];
+    if (undefined === prev || undefined === arr1[i - 2]) continue;
+
+    console.log(`prev:${prev} > arr1[i]:${arr1[i]}`)
+    if (prev > arr1[i]) {
+      let expand = 0;
+      let tmpCount = 0;
+      while (tmpCount === 0) {
+        console.log(`expand:${expand}`)
+        if ((i + expand) === arr1.length) break;
+
+        // Get smallest
+        let toReplace = [], smallest = Infinity;
+        for (let j = 0; j < arr2.length; j++) {
+          console.log(`> ? ${arr1[i - 2]} < ${arr2[j]} < ${arr1[i + expand]} - tmpPrev:${tmpPrev}, arr2[j]:${arr2[j]}`)
+          if (tmpPrev === arr2[j]) return -1;
+          if (arr1[i - 2] < arr2[j] && arr2[j] < arr1[i + expand]) {
+            tmpCount++;
+            // let btwItem = arr2[j];
+            // arr2.splice(j, 1)
+            // tmpPrev = btwItem;
+            // console.log(`> Y ${arr1[i - 2]} < ${arr2[j]} < ${arr1[i + expand]}`)
+            // arr1[i - 1] = btwItem;
+            // console.log(arr1)
+            toReplace.push(arr2[j])
+            smallest = Math.min(smallest, arr2[j]);
+          }
+        }
+        count += tmpCount;
+        console.log("toReplace")
+        console.log(toReplace)
+        console.log("arr1")
+        console.log(arr1)
+        console.log("smallest")
+        console.log(smallest)
+        arr1[i - 1] = smallest;
+
+        expand++;
+      }
+    }
+  }
+
+  return (0 === count) ? -1 : count;
+};
+
+let x = null;
+// x = makeArrayIncreasing([1, 5, 3, 6, 7], [1, 3, 2, 4]);
+// x = makeArrayIncreasing([1, 5, 3, 6, 7], [4, 3, 1]);
+// x = makeArrayIncreasing([1, 5, 3, 6, 7], [1, 6, 3, 3]);
+// x = makeArrayIncreasing([7, 6, 3, 0, 3], [9]);
+x = makeArrayIncreasing([0, 11, 6, 1, 4, 3], [5, 4, 11, 10, 1, 0]);
+
+console.log("Result");
+console.log(x);

1187/solution.js

@@ -67,6 +67,7 @@
 - [771. Jewels and Stones](./771/)
 - [997. Find the Town Judge](./997/)
 - [1161. Maximum Level Sum of a Binary Tree](./1161/)
+- [1187. Make Array Strictly Increasing](./1187/)
 - [1365. How Many Numbers Are Smaller Than the Current Number](./1365/)
 - [1512. Number of Good Pairs](./1512/)
 - [1569. Number of Ways to Reorder Array to Get Same BST](./1569/)
@@ -116,7 +117,7 @@ Batch create:
 NOTE: JS IS HERE
 -->
 ```ssh
-chapter=1569 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
+chapter=1187 && mkdir ./$chapter && touch ./$chapter/my_solution.js && touch ./$chapter/solution.js && alias x="node ./$chapter/my_solution.js"
 ```
 > then you can use `x` for quick debug.
 

README.md

@@ -86,4 +86,6 @@
 // console.log(null + 1);
 
 // Decimal
-console.log(Math.round(324631.99999999994));
+// console.log(Math.round(324631.99999999994));
+
+console.log(0 > 0);