g1001_1100.s1089_duplicate_zeros.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
1089\. Duplicate Zeros
Easy
Given a fixed-length integer array `arr`, 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 and do not return anything.
**Example 1:**
**Input:** arr = [1,0,2,3,0,4,5,0]
**Output:** [1,0,0,2,3,0,0,4]
**Explanation:** After calling your function, the input array is modified to: [1,0,0,2,3,0,0,4]
**Example 2:**
**Input:** arr = [1,2,3]
**Output:** [1,2,3]
**Explanation:** After calling your function, the input array is modified to: [1,2,3]
**Constraints:**
* 1 <= arr.length <= 104
* `0 <= arr[i] <= 9`