Add solution #1089

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,128 LeetCode solutions in JavaScript
+# 1,129 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -869,6 +869,7 @@
 1079|[Letter Tile Possibilities](./solutions/1079-letter-tile-possibilities.js)|Medium|
 1080|[Insufficient Nodes in Root to Leaf Paths](./solutions/1080-insufficient-nodes-in-root-to-leaf-paths.js)|Medium|
 1081|[Smallest Subsequence of Distinct Characters](./solutions/1081-smallest-subsequence-of-distinct-characters.js)|Medium|
+1089|[Duplicate Zeros](./solutions/1089-duplicate-zeros.js)|Easy|
 1092|[Shortest Common Supersequence](./solutions/1092-shortest-common-supersequence.js)|Hard|
 1103|[Distribute Candies to People](./solutions/1103-distribute-candies-to-people.js)|Easy|
 1108|[Defanging an IP Address](./solutions/1108-defanging-an-ip-address.js)|Easy|

solutions/1089-duplicate-zeros.js

@@ -0,0 +1,35 @@
+/**
+ * 1089. Duplicate Zeros
+ * https://leetcode.com/problems/duplicate-zeros/
+ * Difficulty: Easy
+ *
+ * Given a fixed-length integer array arr, duplicate each occurrence of zero, shifting the
+ * remaining elements to the right.
+ *
+ * Note that elements beyond the length of the original array are not written. Do the above
+ * modifications to the input array in place and do not return anything.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {void} Do not return anything, modify arr in-place instead.
+ */
+var duplicateZeros = function(arr) {
+  let zerosToAdd = 0;
+
+  for (let i = 0; i < arr.length; i++) {
+    if (arr[i] === 0) zerosToAdd++;
+  }
+
+  for (let i = arr.length - 1; i >= 0; i--) {
+    if (arr[i] === 0) {
+      zerosToAdd--;
+      if (i + zerosToAdd + 1 < arr.length) {
+        arr[i + zerosToAdd + 1] = 0;
+      }
+    }
+    if (i + zerosToAdd < arr.length) {
+      arr[i + zerosToAdd] = arr[i];
+    }
+  }
+};