[LeetCode]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:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

思路：从头到尾遍历，如果不为0，则移到index位后index加一，index从0开始，这样经过一遍遍历之后index之前的就全都是非零元素了

public class Solution {    public void moveZeroes(int[] nums) {        int index=0;        for(int i=0;i<nums.length;i++){            if(nums[i]!=0){                nums[index]=nums[i];                if(index!=i){                    nums[i]=0;                }                index++;            }        }    }}