【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移到数组最后

思路：定义一个计数的变量count，用来计数组里0的个数

当某一位为0时，count加一

当某一位不为0时，把这一位复制到前面0的位置去

最后把数组后面count位替换为0

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

            }
            for(int j=nums.length-count;j<nums.length;j++)
            {
                nums[j]=0;
            }
    }
}