Search

Move Zeroes

Updated: Mar 24, 2021

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:

  1. You must do this in-place without making a copy of the array.

  2. Minimize the total number of operations.

Solution:

class Solution {
    public void moveZeroes(int[] nums) {
    int j = -1;
    for (int i = 0; i < nums.length; i++)
    {
        if (nums[i] != 0) 
        {
            j++;
            int temp = nums[i];
            nums[i]=nums[j];
            nums[j]=temp;
            
        }
    }
    }
}

8 views0 comments

Recent Posts

See All

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.