Title: Move Zeroes Source: leetcode.com
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.
Java solution
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 |
/* https://leetcode.com/problems/move-zeroes/ */ class MoveZeroes { public static void main(String args[]) { MoveZeroes solution = new MoveZeroes(); // int[] nums = {0}; // int[] nums = {1, 0}; // int[] nums = {0, 1}; // int[] nums = {0, 0, 0}; // int[] nums = {1,0,1}; // int[] nums = {1, 2, 3}; int[] nums = {0, 1, 0, 3, 12}; solution.moveZeroes(nums); } public void moveZeroes(int[] nums) { int ptr = 0; int i = 0; while(i<nums.length){ if(nums[i]!=0){ nums[ptr++] = nums[i]; } i++; } while(ptr<nums.length){ nums[ptr++] = 0; } for(int num: nums) System.out.print(num+"\t"); } } |