首页 > 其他 > 详细

[LeetCode] Move Zeroes

时间:2015-09-20 16:06:41      阅读:183      评论: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.

 

分析:快速排序Partition的应用。时间复杂度O(n),空间复杂度O(1)

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

 

[LeetCode] Move Zeroes

原文:http://www.cnblogs.com/vincently/p/4823415.html

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