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

Move Zeroes

时间:2015-10-11 10:11:04      阅读:166      评论: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.

 1 class Solution {
 2 public:
 3     void moveZeroes(vector<int>& nums) {
 4             for (int i = 0,j=0; i < nums.size() ; ++i)
 5         {
 6             if(nums[i]&&j==i)
 7             j++;
 8         else if (nums[i])
 9             {
10                     swap(nums[i], nums[j++]);
11             }
12         }
13     }

14 }; 

Move Zeroes

标签:

原文地址:http://www.cnblogs.com/-vector/p/4868817.html

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