Given a fixed length array arr of integers, 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, do not return anything from your function.
Example 1:
Input: [1,0,2,3,0,4,5,0]
Output: null
Explanation: After calling your function, the input array is modified to: [1,0,0,2,3,0,0,4]
Example 2:
Input: [1,2,3]
Output: null
Explanation: After calling your function, the input array is modified to: [1,2,3]
Note:
1 <= arr.length <= 10000
0 <= arr[i] <= 9
Solution:
First, go left to right and count how many shifts (sh) we can fit in our array. Then, go right to left and move items; if it's zero - duplicate it and decrement the shift.
Note: i + sh can exceed the array size. We need a check for this case.
class Solution {
public void duplicateZeros(int[] arr) {
int i = 0, shift = 0;
for (i = 0; i + shift < arr.length; i ++) {
shift += arr[i] == 0 ? 1 : 0;
}
for (i = i - 1; shift > 0; i --) {
if (i + shift < arr.length) {
arr[i + shift] = arr[i];
}
if (arr[i] == 0) {
arr[i + --shift] = 0;
}
}
}
}