题目:
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移到末尾去。有两种思路,一种是将非零元素直接向前提,另外一种是将零与非零元素交换位置。方法一需要使用一个变量记录非零元素的个数,方便将非零元素查到指定位置,并且在最后对数组最后几个元素进行置零操作。代码入下:
public void moveZeroes1(int[] nums) {
if (nums == null || nums.length == 0) return;
int insertPos = 0;
for (int num: nums) {
if (num != 0) nums[insertPos++] = num;
}
while (insertPos < nums.length) {
nums[insertPos++] = 0;
}
}
方法二是将非零元素搬移到指定元素位置,并将二者进行置换。这样的好处是免去了最后的置零操作,但是也增加了元素置换的操作==代码入下;
public void moveZeroes2(int[] nums) {
int j = 0;
for(int i = 0; i < nums.length; i++) {
if(nums[i] != 0) {
int temp = nums[j];
nums[j] = nums[i];
nums[i] = temp;
j++;
}
}
}