题目描述:
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:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
解题思路:我们可以重新定义一个数组,然后扫描第一个数组,非0的就可以放到第二个数组中,依次算,然后第二个数组剩下的长度就填0即可~但是题目要求不允许重新定义数组.那么我们只能在原数组中想办法,也就是我不重新生成数组了,而是用一个指针,开始初始化为0,扫描的同时碰到非0的,我就记录在同一个数组里面,同时指针++,因为我始终是移动的,肯定覆盖的值不会影响我后面扫描的值,于是这样的时间复杂度是0(1),空间复杂度是0(N),详细见下面代码:
C++代码:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
//关键是把握只有俩种数这个特性,那么我们就可以先将非0的给挑出来(非0和0)
int i = 0,pointer=0;
int len = nums.size();
for(i = 0;i<len;i++) //i是用来控制整个数组流动的
{
if(nums[i]!=0)
{
nums[pointer++] = nums[i];
}
}
for(i = pointer;i<len;i++)
{
nums[i] = 0;
}
}
};
python代码:
class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
length = len(nums)
i = pointer = 0
for i in range(length):
if nums[i]!=0:
nums[pointer] = nums[i]
pointer = pointer+1
for i in range(pointer,length): #后面全补0
nums[i] = 0