Keep a write index that tracks where the next non-zero value belongs. Walk through the array and whenever you encounter a non-zero value, place it at the write index and increment.

Move Zeroes

easy

Acceptance: 67%

ArraysTwo Pointers

Given an integer array, rearrange it so that every zero appears at the end while all non-zero elements retain their original relative ordering. The transformation must be performed in-place, without creating a separate copy of the data.

Examples

Example 1:

Input:arr = [0,4,0,2,7]

Output:[4,2,7,0,0]

Explanation: Non-zero values 4, 2, and 7 keep their left-to-right order; zeroes are pushed to the back.

Example 2:

Input:arr = [3]

Output:[3]

Explanation: A single non-zero element requires no changes.

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Move Zeroes

Examples

Hints

Related Problems