g1001_1100.s1089_duplicate_zeros.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g1001_1100.s1089_duplicate_zeros;
// #Easy #Array #Two_Pointers #2022_02_24_Time_2_ms_(67.91%)_Space_46.1_MB_(15.10%)
public class Solution {
public void duplicateZeros(int[] arr) {
int countZero = 0;
for (int k : arr) {
if (k == 0) {
countZero++;
}
}
int len = arr.length + countZero;
// We just need O(1) space if we scan from back
// i point to the original array, j point to the new location
int i = arr.length - 1;
int j = len - 1;
while (i < j) {
// copy twice when hit '0'
if (arr[i] == 0) {
if (j < arr.length) {
arr[j] = arr[i];
}
j--;
}
if (j < arr.length) {
arr[j] = arr[i];
}
i--;
j--;
}
}
}