0283 - Move Zeroes

[rkkksss]

Description of the Problem

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.

Code

class Solution:
    def moveZeroes(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """

Link To The LeetCode Problem

LeetCode

[rkkksss]

Hi @vJechsmayr accept this issue, please :)

[ankitsri98]

Hey , Please Have A look At My Pull Request, I have clearly explained the Problem with explanation and code. please Merge it. THANK YOU