首页 > 其他 > 详细

Move Zeroes

时间:2015-09-23 16:34:39      阅读:208      评论:0      收藏:0      [点我收藏+]

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.
public class Solution {
    public void moveZeroes(int[] nums) {
        int size = nums.length;
        int n = 0;
        for(int i=0;i<size;i++) {
            if(nums[i]!=0) {
                nums[n++] = nums[i];
            }
        }
        for(int i=n;i<size;i++) {
            nums[i] = 0;
        }
    }
}

 

Move Zeroes

原文:http://www.cnblogs.com/mrpod2g/p/4832311.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!