@@ -0,0 +1,668 @@
+/**%0A * 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.%0A */%0A%0A%0Aclass Solution %7B%0A    public void moveZeroes(int%5B%5D nums) %7B%0A        int zeroCount = 0;%0A        int curr = 0;%0A        %0A        //Move all occurences of num%0A        for(int i = 0; i %3C nums.length; i++)%7B%0A            if(nums%5Bi%5D != 0)%7B%0A                nums%5Bcurr%5D = nums%5Bi%5D;%0A                curr++;%0A            %7D else %7B%0A                zeroCount++;%0A            %7D%0A        %7D%0A        %0A        //Zero the end of the array;%0A        for(int i = nums.length - zeroCount; i %3C nums.length; i++)%7B%0A            nums%5Bi%5D = 0;%0A        %7D%0A    %7D%0A%7D

move zeroes to end