1.题目
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.
2.解题思路
当我拿到这个题目的时候,第一个想到的就是使用堆栈,遍历一遍数组,零则入栈,非零则入栈,赋值,出栈,最后将栈里的元素全部出栈赋值即可。
有一种大佬级别的思路,遍历一遍数组,零则不处理,记住这个零的下标,直到遇到非零是,将这两个值互换,这样一遍下去,所有的零元素就别移动到数组末端了。
example
i为遍历下边,j为当前零的下标
0,1,0,3,12
i = 0, j = 0:
0,1,0,3,12
i = 1, j = 0
1,0,0,3,12
i = 2, j = 1
1,0,0,3,12
i = 3, j = 1
1,3,0,0,12
i = 4, j = 2
1,3,12,0,0
完毕
3.代码
public class MoveZeroes {
public static void movezeroes(int[] nums) {
for(int i = 0, j = 0; i < nums.length; i++) {
if(nums[i] != 0) {
int tmp = nums[i];
nums[i] = nums[j];
nums[j++] = tmp;
}
}
}
}