题目描述:
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.
解题思想
使用两个指针i j: i遍历整个数组,只要当前元素值不为0,则交换i,j指向元素的值,然后j++.J始终指向第一个0元素,[j,i]区间内即为所有的0元素。
示例:
y
x
0 1 0 3 12 x=0 y=0
y x
0 1 0 3 12 x=1 y=0 swap
y x 1 0 0 3 12 x=2 y=1 y x 1 0 0 3 12 x =3 y=1 swap y x 1 3 0 0 12 x= 4 y=2 swap y x 1 3 12 0 0 x= 4 y =3
代码实现
public class Solution {
public void moveZeroes(int[] nums) {
int i=0 ,j = 0;
for(; i < nums.length;i++){
if(nums[i]!=0){
int tmp = nums[j];
nums[j] = nums[i];
nums[i] = tmp;
j++;
}
}
}
}