283. 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.
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.
两个指针维持查找
我的AC解法
public void moveZeroes(int[] nums) {
if (nums == null
|| nums.length == 0) {
return;
}
int n = nums.length;
// low指向为0的元素
int low = 0;
// high指向low后第一个不为0的元素
int high = 0;
while (low < n && high < n) {
while (low < n && nums[low] != 0)
low++;
high = low;
while (high < n && nums[high] == 0)
high++;
if (low < n && high < n) {
int tmp = nums[low];
nums[low] = nums[high];
nums[high] = tmp;
high = low + 1;
}
}
}
如果此题改为把0移动到开头,则从末尾往前遍历即可
网上的top discuss解法:简洁
public void moveZeroes(int[] nums) {
// 用i指向不为0的元素,j指向从0开始,
// 每次交换后j++
// 每次把不为0的元素挪到最前面
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++;
}
}
}
另外一种
我们观察数组前后改变的样式,就可以发现,第i个非零元素前面有count个0,那么他的位置就向前移动了count个位置,因此我们只需要将每个非零元素前面的0的个数计算出来,并且将非零元素向前移动count个位置;最后,从数组的尾部开始,将最后count个元素置为零即可。
public void moveZeroes(int[] nums) {
int i = 0;
int count = 0;
int m = nums.length - 1;
while (i <= m) {
if (nums[i] == 0) {
// 计算0的个数
count++;
i++;
}
// i不等于0
else {// 将nums[i]向前移动count个位置
nums[i - count] = nums[i];
i++;
}
}
// 将数组的最后count个元素置为0
for (int j = count; j >= 1; j--) {
nums[m] = 0;
m--;
}
}