首页 > itarticle > 【leetcode】283. move zeroes

【leetcode】283. move zeroes

admin 11月 13, 2020 0

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

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

Solution

public void (int[] nums) {
        int index = 0;
        int len = nums.length;
        for (int i = 0; i < len; i++) {
            if (nums[i] != 0) {
                nums[index] = nums[i];
                index++;
            }
        }
        for (int j = index; j < nums.length; j++) {
            nums[j] = 0;
        }
    }

Analyse

不要被相对排序不变吓到，其实添加一个新的index来记录非0的数就可以了。