# LeetCode - Duplicate Zero(1089)

#### 1089. 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: 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

#### 思考邏輯

array 在特定的 index 插入元素需要將所在元素向右平移一個位置，才能夠加入。

#### Solution

func duplicateZeros(arr []int){
for i := 0; i < len(arr); i++{
if arr[i] == 0 && i+1 < len(arr) {
arr = append(arr[:i+1], arr[i:len(arr)-1]...)
i ++
}
}
}