原題鏈接: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:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.
C++
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int end = 0, start = 0;
while(start < nums.size()) {
if(nums[start] != 0) {
swap(nums[end], nums[start]);
end++;
}
start++;
}
}
};
Python
class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
count_z = 0
cur = 0
for i in range(0, len(nums)):
if nums[i] != 0:
nums[cur] = nums[i]
cur += 1
else:
count_z += 1
for s in range(cur, len(nums)):
nums[s] = 0