283. Move Zeroes

283. Move Zeroes

 

 

Total Accepted: 71969 Total Submissions: 163725 Difficulty: Easy

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. 1. You must do this in-place without making a copy of the array.
   2. Minimize the total number of operations

Code:

void moveZeroes(int* nums, int numsSize) {
    int i=0;   
    int j=0;   
    while(j<numsSize) {   
        if(nums[j]!=0)  
        {   
              if(j!=i)  
              {    
                    nums[i++] = nums[j];   
                    nums[j] = 0;   
               } else  
               {   
                   ++i;   
               }   
        }    
        ++j;   
    }
}

转载于:https://www.cnblogs.com/Alex0111/p/5373702.html