LCR 283. Move Zero

Jan 4, 202486

AI Translation

This post is translated from Chinese into English through AI.View Original

AI-generated summary

Given an array nums, the task is to move all the zeros to the end of the array while maintaining the relative order of non-zero elements. The operation must be done in-place without copying the array. The solution uses a two-pointer approach to swap non-zero elements to the left side of the array.

Given an array nums, write a function to move all 0's to the end of the array while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.

Example 1:

Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]
Example 2:

Input: nums = [0]
Output: [0]

Constraints:
1 <= nums.length <= 104
-231 <= nums[i] <= 231 - 1

Solution 1: Two Pointers

func moveZeroes(nums []int)  {
	left, right, n := 0,0,len(nums)
	for right < n {
		if nums[right] != 0 {
			nums[left], nums[right] := nums[right], nums[left]
			left++
		}
		right++
	}
}