@@ -0,0 +1,797 @@
+/**%0A * Author : Laberat%0A * Date   : 16/2/3.%0A * Link   : https://leetcode.com/problems/move-zeroes/%0A * Number : # 283%0A * Desc   : Given an array nums, write a function to move all 0's to the end of it%0A *          while maintaining the relative order of the non-zero elements.%0A *          You must do this in-place without making a copy of the array.%0A *          Minimize the total number of operations.%0A */%0Apublic class MoveZeroes %7B%0A    public void moveZeroes(int%5B%5D nums) %7B%0A        int count = 0;%0A        for (int i = 0;i %3C nums.length;i ++) %7B%0A            if (nums%5Bi%5D == 0) %7B%0A                count ++;%0A            %7D else %7B%0A                nums%5Bi - count%5D = nums%5Bi%5D;%0A            %7D%0A        %7D%0A        for (int i = nums.length - count;i %3C nums.length;i ++) %7B%0A            nums%5Bi%5D = 0;%0A        %7D%0A    %7D%0A%7D%0A

solve # 283