LeetCode 283. Move Zeroes

来源：互联网发布：淘宝试用报名技巧编辑：程序博客网时间：2024/06/05 19:48

Description

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.

Analysis

把所有非0元素提到前面来，尾部赋上适当数量的0即可。需要设置两个指针变量，一个用来遍历，另一个用来控制非0元素的“提前”。

Code

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

Appendix

Link: https://leetcode.com/problems/move-zeroes/
Run Time: 16ms

0 0