## Description

https://leetcode.com/problems/duplicate-zeros/

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:nullExplanation:After calling your function, theinputarray is modified to: [1,0,0,2,3,0,0,4]

**Example 2:**

Input:[1,2,3]Output:nullExplanation:After calling your function, theinputarray is modified to: [1,2,3]

**Note:**

`1 <= arr.length <= 10000`

`0 <= arr[i] <= 9`

## Explanation

Use a temp array to store numbers in the new order.

## Python Solution

```
class Solution:
def duplicateZeros(self, arr: List[int]) -> None:
"""
Do not return anything, modify arr in-place instead.
"""
temp = []
for num in arr:
if num == 0:
temp.append(0)
temp.append(0)
else:
temp.append(num)
for i in range(len(arr)):
arr[i] = temp[i]
```

- Time Complexity: O(N)
- Space Complexity: O(N)

I found that solution very popular and helpful:

https://www.youtube.com/watch?v=gaB-guUxCWI&ab_channel=EricProgramming

I found that solution very popular and helpful:

https://www.youtube.com/watch?v=gaB-guUxCWI&ab_channel=EricProgramming