码迷,mamicode.com
首页 > 其他好文 > 详细

283. Move Zeroes

时间:2018-05-19 10:34:39      阅读:154      评论:0      收藏:0      [点我收藏+]

标签:NPU   div   while   length   nbsp   not   pre   for   fun   

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.

Input: [0,1,0,3,12]
Output: [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.

 

 

代码:

class Solution {
    public void moveZeroes(int[] nums) {
        int index = 0;
        for(int i = 0; i<nums.length; i++){
            if(nums[i] != 0){
                nums[index]=nums[i];
                index++; 
            }   
        }       
        for(int i = index; i< nums.length; i++){
            nums[i] = 0;
        }
    }
}

 

283. Move Zeroes

标签:NPU   div   while   length   nbsp   not   pre   for   fun   

原文地址:https://www.cnblogs.com/liuliu5151/p/9059077.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!