solves duplicate zeros

Author: anishLearnsToCode

README.md

@@ -291,9 +291,9 @@
 | 1065 | 🔒 [Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string)                                                                  |                                                                                                                                                                             |                                                                                                                                   |
 | 1071 | [Greatest Common Divisors of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings)                                              |                                                     [![Java](assets/java.png)](src/GreatestCommonDivisorOfStrings.java)                                                     |                                                                                                                                   |
 | 1078 | [Occurrence After Bigram](https://leetcode.com/problems/occurrences-after-bigram)                                                                    |                                                         [![Java](assets/java.png)](src/OccurrencesAfterBigram.java)                                                         |                                                                                                                                   |
-| 1085 | [Sum of Digits in Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number)                                                 |                                                                                                                                                                             |                                                                                                                                   |
-| 1086 | [High Five](https://leetcode.com/problems/high-five)                                                                                                 |                                                                                                                                                                             |                                                                                                                                   |
-| 1089 | [Duplicate Zeroes](https://leetcode.com/problems/duplicate-zeros)                                                                                    |                                                                                                                                                                             |                                                                                                                                   |
+| 1085 | 🔒 [Sum of Digits in Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number)                                              |                                                                                                                                                                             |                                                                                                                                   |
+| 1086 | 🔒 [High Five](https://leetcode.com/problems/high-five)                                                                                              |                                                                                                                                                                             |                                                                                                                                   |
+| 1089 | [Duplicate Zeroes](https://leetcode.com/problems/duplicate-zeros)                                                                                    |                                                             [![Java](assets/java.png)](src/DuplicateZeros.java)                                                             |                                                                                                                                   |
 | 1099 | [Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k)                                                                             |                                                                                                                                                                             |                                                                                                                                   |
 | 1103 | [Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people)                                                           |                                                                                                                                                                             |                                                                                                                                   |
 | 1108 | [Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address)                                                                     |                                                                                                                                                                             |                                                                                                                                   |

src/DuplicateZeros.java

@@ -0,0 +1,21 @@
+public class DuplicateZeros {
+    public void duplicateZeros(int[] array) {
+        int removals = 0, k = array.length - 1;
+        for (int i = 0 ; i < array.length - removals ; i++) {
+            if (array[i] == 0) {
+                if (i == array.length - 1 - removals) {
+                    array[k--] = 0;
+                }
+                removals++;
+            }
+        }
+        for (int i = array.length - 1 - removals ; i >= 0 ; i--, k--) {
+            if (array[i] == 0) {
+                array[k] = array[k - 1] = 0;
+                k--;
+            } else {
+                array[k] = array[i];
+            }
+        }
+    }
+}