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.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 | void moveZeroes(int* nums, int numsSize){ int i = 0, j = 0; for(i = 0; i < numsSize; i++){ //copy non-zero elements if(nums[i] != 0){ nums[j] = nums[i]; j++; } } //put zeros in the end while(j < numsSize){ nums[j++] = 0; } } |
Nice Blog! I really loved reading through this Blog... Thanks for sharing.......
ReplyDeleteAwesome Blog thanks for share your valuable information
Inwizards Technology - Internet of Things IoT
iot development company
hire iot developer