Given an array
nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.
For example, given
nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].
Note:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
public class Solution {
public void moveZeroes(int[] nums) {
int n = nums.length;
int cnt = 0;
for(int i = 0; i < n; i++){
if(nums[i] != 0){
nums[cnt] =nums[i];
cnt++;
}
}
for(int i = cnt; i < n; i++){
nums[i] = 0;
}
}
}
find non-zero first, then put them according the relative order. set the rest with '0'
No comments:
Post a Comment