add 1089

Author: luliyucoordinate

Diff for: README.md

@@ -419,4 +419,5 @@ LeetCode
 |1081|[Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/) | c | [c++](./src/1081-Smallest-Subsequence-of-Distinct-Characters/1081.cpp) |[python](./src/1081-Smallest-Subsequence-of-Distinct-Characters/1081.py)|||Medium|
 |1085|[Sum of Digits in the Minimum Number](https://leetcode.com/contest/biweekly-contest-2/problems/sum-of-digits-in-the-minimum-number/) | c | [c++](./src/1085-Sum-of-Digits-in-the-Minimum-Number/1085.cpp) |[python](./src/1085-Sum-of-Digits-in-the-Minimum-Number/1085.py)|||Easy|
 |1086|[High Five](https://leetcode.com/contest/biweekly-contest-2/problems/high-five/) | c | [c++](./src/1086-High-Five/1086.cpp) |[python](./src/1086-High-Five/1086.py)|||Easy|
-|1087|[Brace Expansion](https://leetcode.com/contest/biweekly-contest-2/problems/brace-expansion/) | c | [c++](./src/1087-Brace-Expansion/1087.cpp) |[python](./src/1087-Brace-Expansion/1087.py)|||Medium|
+|1087|[Brace Expansion](https://leetcode.com/contest/biweekly-contest-2/problems/brace-expansion/) | c | [c++](./src/1087-Brace-Expansion/1087.cpp) |[python](./src/1087-Brace-Expansion/1087.py)|||Medium|
+|1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) | c | [c++](./src/1089-Duplicate-Zeros/1089.cpp) |[python](./src/1089-Duplicate-Zeros/1089.py)|||Easy|

Diff for: src/1089-Duplicate-Zeros/1089.cpp

@@ -0,0 +1,13 @@
+class Solution 
+{
+public:
+    void duplicateZeros(vector<int>& arr) 
+    {
+        int n = arr.size(), j = n + count(arr.begin(), arr.end(), 0);
+        for (int i = n - 1; i >= 0; --i)
+        {
+            if (--j < n) arr[j] = arr[i];
+            if (arr[i] == 0 and --j < n) arr[j] = 0;
+        }
+    }
+};

Diff for: src/1089-Duplicate-Zeros/1089.py

@@ -0,0 +1,14 @@
+class Solution:
+    def duplicateZeros(self, arr: List[int]) -> None:
+        """
+        Do not return anything, modify arr in-place instead.
+        """
+        n, j = len(arr), arr.count(0) + len(arr)
+        for i in range(n-1, -1, -1):
+            j -= 1
+            if j < n:
+                arr[j] = arr[i]
+            if arr[i] == 0:
+                j -= 1
+                if j < n:
+                    arr[j] = 0