问题:
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
思路:两个指针,一个指向“0”,一个指向非“0”,从左向右,如果找到,则交换
代码:
public void moveZeroes(int[] nums) {
int i = 0;
int j = 0;
while(j < nums.length){
if(nums[j] != 0){
if(j !=i ){
nums[i] = nums[j];
nums[j] = 0;
i++;
}
else{
++i;
}
}
++j;
}
}