## Move Zeroes

###### DESCRIPTION (credit Leetcode.com)

Given an integer array nums, write a function to rearrange the array by moving all zeros to the end while keeping the order of non-zero elements unchanged. Perform this operation in-place without creating a copy of the array.

###### EXAMPLES

Input:

`nums = [2,0,4,0,9]`

Output:

`[2,4,9,0,0]`

Run your code to see results here

## Explanation

We can solve this problem by keeping a pointer i that iterates through the array and another pointer nextNonZero that points to the position where the next non-zero element should be placed. We can then swap the elements at i and nextNonZero if the element at i is non-zero. This way, we can maintain the relative order of the non-zero elements while moving all the zeroes to the end of the array.

## Solution

def moveZeroes(nums):nextNonZero = 0for i in range(len(nums)):if nums[i] != 0:nums[nextNonZero], nums[i] = nums[i], nums[nextNonZero]nextNonZero += 1

move zeros

0 / 13

1x

Compare UsCompare to Interviewing.io

© 2024 Optick Labs Inc. All rights reserved.

Loading comments...