leetcode-patterns-java/LeetCode_Problems/Java/easy/1089. Duplicate Zeros.java at main · elchibek5/leetcode-patterns-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
class Solution {
    public void duplicateZeros(int[] arr) {
        int n = arr.length;
        int count = 0;

        for (int i = 0; i < n; i++) {
            if (arr[i] == 0) {
                count++;
            }
        }

        int write = n + count - 1;

        for (int i = n - 1; i >= 0; i--) {
            if (write < n) {
                arr[write] = arr[i];
            }
            write--;

            if (arr[i] == 0) {
                if (write < n) {
                    arr[write] = 0;
                }
                write--;
            }
        }


    }
}