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 void moveZeroes(int* nums, int numsSize) { 2 int i; 3 int count = 0; 4 int k = 0; 5 for(i = 0; i < numsSize; i++) 6 { 7 if(nums[i] == 0) 8 count++; 9 } 10 for(i = 0; i < numsSize; i++) 11 { 12 if(nums[i] != 0) 13 nums[k++] = nums[i]; 14 } 15 while(count) 16 { 17 nums[k++] = 0; 18 count--; 19 } 20 }
原文：http://www.cnblogs.com/boluo007/p/5483572.html