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:
这个移动必须是在原地一动,不能借助其他的容器。
基本的思想是将所有的不是0的数都往前移动,最后在根据容器的最初大小补上0就可以了
1 #include <vector> 2 using namespace std; 3 class Solution{ 4 public: 5 void moveZeros(vector<int> & nums){ 6 auto sz = nums.size(); 7 int pos = 0; 8 for (int i = 0; i < sz; ++i){ 9 if (nums[i] != 0) 10 nums[pos++] = nums[i]; 11 } 12 for (int i = pos; i < sz; ++i) 13 nums[i] = 0; 14 } 15 };
大体上就是这样(PS:这个方法好像叫做双指针压缩法)
LeetCode OJ :Move Zeroes (移动0)
原文:http://www.cnblogs.com/-wang-cheng/p/4855078.html