zoukankan      html  css  js  c++  java
  • 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. 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;   
        }
    }

  • 相关阅读:
    Java框架之Mybatis(一)
    Java框架之Hibernate(四)
    Java框架之Hibernate(三)
    递归与分治
    散列
    绪论
    系统的分类(二)
    系统的定义与分类(一)
    Guess My Number 游戏
    2.5 随机数的生成
  • 原文地址:https://www.cnblogs.com/Alex0111/p/5373702.html
Copyright © 2011-2022 走看看