首页 > 其他 > 详细

LeetCode 283

时间:2016-04-25 00:24:59      阅读:178      评论:0      收藏:0      [点我收藏+]

Move Zeros

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.

 

 1 public class Solution {
 2     public void moveZeroes(int[] nums) {
 3         int a = 0;
 4         int b = 0;
 5         for(int i = 0 ; i < nums.length ; i++){
 6             if( nums[i] == 0 ){
 7                 a++;
 8             }else{
 9                 nums[b] = nums[a];
10                 a++;
11                 b++;
12             }
13         }
14         while(b < nums.length){
15             nums[b]=0;
16             b++;
17         }
18     }
19 }

 

LeetCode 283

原文:http://www.cnblogs.com/Juntaran/p/5428855.html

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