首页 > 其他 > 详细

LeetCode-283.Move Zeroes

时间:2019-02-25 16:11:56      阅读:120      评论: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.

Example:

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

  

LeetCode-283.Move Zeroes

原文:https://www.cnblogs.com/zhacai/p/10431000.html

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