题目链接:https://leetcode.com/problems/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.
思路:怒刷了三道水题,睡觉了,神秘园真是一个很好听的专辑
class Solution {
public:
void moveZeroes(vector<int>& nums) {
for(int i =0, k =0; i < nums.size(); i++)
if(nums[i]!= 0) swap(nums[i], nums[k++]);
}
};
python
class Solution(object):
def moveZeroes(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
k = 0;
for index in range(len(nums)):
if nums[index]!=0:
nums[k], nums[index] = nums[index], nums[k]
k += 1