首页 > itarticle > [leetcode] problem 283 – move zeroes

[leetcode] problem 283 – move zeroes

admin 11月 13, 2020 0

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.

Example

Input: [0,1,0,3,12]

Output: [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.

Code

public void (int[] nums) {
    int start = 0;
    int end = 0;

    while (end < nums.length) {
        if (nums[end] != 0) {
            int temp = nums[start];
            nums[start] = nums[end];
            nums[end] = temp;
            start++;
        }

        end++;
    }
}