Leetcode: Duplicate Zeros

Duplicate Zeros



Similar Problems:


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. 1 <= arr.length <= 10000
  2. 0 <= arr[i] <= 9

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


  • Solution:
// Blog link: https://code.dennyzhang.com/duplicate-zeros
// Basic Ideas: use a queue to save elements we want to fill
// Complexity: Time O(n), Space O(1)
func duplicateZeros(arr []int)  {
    l := []int{}
    for i, v := range arr {
        if v == 0 {
            l = append(l, 0)
            l = append(l, 0)
        } else {
            l = append(l, v)
        }
        arr[i] = l[0]
        l = l[1:len(l)]
    }
}
linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.