LeetCode 283 Move Zeroes

Description

给你一个数组，让你把0全部排到后面去，要求总操作最少

Algorithm

找到0，就往后找不是0的，找的了就交换，注意下边界处理就好了

class Solution {public:    void moveZeroes(vector<int>& nums) {        int n = nums.size();        for (int i = 0; i < n; i++) {            if (nums[i] == 0) {                int j = i;                while (nums[j + 1] == 0) {                    j++;                    if (j == n - 1) break;                }                if (j == n - 1) break;                nums[i] = nums[j + 1];                nums[j + 1] = 0;            }        }    }};