LeetCode75——Day10

一、题目

283. Move Zeroes

Given an integer array nums, move all 0’s to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

Example 1:

Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]
Example 2:

Input: nums = [0]
Output: [0]

Constraints:

1 <= nums.length <= 104
-231 <= nums[i] <= 231 - 1

Follow up: Could you minimize the total number of operations done?

二、题解

双指针

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size();
        int left = 0;
        for(int right = 0;right < n;right++){
            if(nums[right] != 0) nums[left++] = nums[right];
        }
        while(left < n) nums[left++] = 0;
    }
};
1
2
3
4
5
6
7
8
9
10
11