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 1:**

- You must do this in-place without making a copy of the array.

- Minimize the total number of operations.

[title]:https://leetcode.com/problems/move-zeroes/

package Solution

funcmoveZeroes(nums []int) []int {

for_,i:=rangenums {

ifi!=0 {

nums[count]=i

}

}

fori:=count;i<len(nums);i++ {

nums[temp]=0

}

}

package Solution

import (

)

funcTestMoveZeroes(t*testing.T) {

cases:= []struct {

inputs []int

expects []int

}{

{"test case 1", []int{0,1,0,3,12}, []int{1,3,12,0,0}},

}

for_,testcase:=rangecases {

t.Run(testcase.name,func(t*testing.T) {

result:=moveZeroes(testcase.inputs)

if!reflect.DeepEqual(result,testcase.expects) {

t.Fatalf("expected: %v, but got: %v, with input: %v ",testcase.expects,result,testcase.inputs)

}

})

}

}