Move Zeroes - Array - Easy - LeetCode

1 min read 81 words

sumitc9125 September 2020Updated: 25 September 2020 1 min read

ShareWhatsApp Post on X

1The function moves all zeros in an array to the end while preserving the order of non-zero elements.
2The solution operates in-place, requiring no additional array copies.
3It achieves a time complexity of O(n) and a space complexity of O(1).

AI-generated summary · May not capture all nuances

Key Insight

AskGif

"The function moves all zeros in an array to the end while preserving the order of non-zero elements."

— Move Zeroes - Array - Easy - LeetCode

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.

public class Solution {
 public void MoveZeroes(int[] nums) {
 int pos = 0;
 for(int i=0;i<nums.Length;i++){
 if(nums[i]!=0){
 nums[pos]=nums[i];
 pos++;
 }
 }
 
 while(pos<nums.Length){
 nums[pos]=0;
 pos++;
 }
 }
}

Time Complexity: O(n)

Space Complexity: O(1)

🛒 You'll Need This

Products related to this article