一、问题描述
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和cur,其中i为快指针,cur为慢指针。
三、算法代码
public class Solution {
public void moveZeroes(int[] nums) {
int cur = 0;
for(int i = 0; i <= nums.length - 1; i++){
if(nums[i] != 0){
if(nums[cur] ==0){
nums[cur] = nums[i];
nums[i] = 0;
cur++;
}else{
cur++;
}
}
}
}
}