Leetcode#283. 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.

题意

将数组中的零全部放在数组的末尾。（只能在原数组更改不能使用新的数组）

题解

遍历，先把不为0的以此放在数组的前面，后面全部补1

python代码

class Solution(object):
    def moveZeroes(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        index = 0
        for i in range(0, len(nums)):
            if nums[i] != 0:
                nums[index] = nums[i]
                index = index + 1
        for i in range(index, len(nums)):
            nums[i] = 0

C++代码

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int index = 0;
        for(int i=0; i<nums.size(); i++)
        {
            if(nums[i] !=0){
                nums[index++] = nums[i];
            }
        }
        for(int i=index; i<nums.size(); i++)
        {
            nums[i] = 0;
        }

    }
};