【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:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations

限制不能用array的拷贝，所以想法就是遍历遇到非零的元素，判断非零元素下一个元素是否为0，是0那么就swap，非零就index++

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

 

转载于:https://www.cnblogs.com/Doctengineer/p/5810994.html