283. Move Zeroes (Easy)
https://leetcode.com/problems/move-zeroes/
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.
Example:
Input:[0,1,0,3,12]
Output:[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.
Solutions
class Solution {
public void moveZeroes(int[] nums) {
if (nums == null || nums.length <= 1) {
return;
}
// keep count of 0
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 0) {
count++;
continue;
}
// nums[i] is not 0 to reach here.
// move it to the proper position, but if i == (i - count), never move
if (i == (i - count)) {
continue;
}
nums[i-count] = nums[i];
// set the value of original slot to 0
nums[i] = 0;
}
}
}