/*

Given an array nums, please 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.

*/

​

using System;

using Xunit;

​

namespace CodingTask

{

    public class Program

    {

        public class Solution 

        {

            public void MoveZeroes(int[] nums) 

            {

                throw new NotImplementedException();

            }

        }

        public class SolutionTests

        {

            public void Test(int[] input, int[] output)

            {

                new Solution().MoveZeroes(input);

​

                Assert.Equal(output, input);

            }

        }

​

        public static void Main()

        {

            new SolutionTests().Test(new int[] { 0, 1, 0, 3, 12 }, new int[] { 1, 3, 12, 0, 0 });

            Console.WriteLine("Test 1 Passed");

​

            new SolutionTests().Test(new int[] { 2, 1, 4, 3, 7 }, new int[] { 2, 1, 4, 3, 7 });

            Console.WriteLine("Test 2 Passed");

            new SolutionTests().Test(new int[] { 0, 0, 0, 0, 0 }, new int[] { 0, 0, 0, 0, 0 });

            Console.WriteLine("Test 3 Passed");

            new SolutionTests().Test(new int[] { 0, 0, 1 }, new int[] { 1, 0, 0 });

            Console.WriteLine("Test 4 Passed");

        }

    }

}