283. Move Zeroes 把0元素移到数组后面

283. Move Zeroes

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.

把所有非0元素全部前移,最后省下的位置补0。j下标只有赋值以后才能++, i下表负责找非0元素,找到了给j下标然后继续找

 1 class Solution {
 2 public:
 3     void moveZeroes(vector<int>& nums) {
 4         int j = 0;
 5         // move all the nonzero elements advance
 6         for (int i = 0; i < nums.size(); i++) {
 7             if (nums[i] != 0) {
 8                 nums[j++] = nums[i];
 9             }
10         }
11         for (;j < nums.size(); j++) {
12             nums[j] = 0;
13         }
14     }
15 };

 

posted @ 2017-10-29 18:59  绿宝宝怪  阅读(99)  评论(0编辑  收藏  举报
#site_nav_under,#ad_under_post_holder,#under_post_news,#google_ad_c2,#under_post_kb{ width:0; height:0; display:none; overflow:hidden; }