Merge branch 'pull_request/53' into develop

6boris · 6boris · commit ca57ff625d15 · 2019-03-19T18:16:42.000+08:00
diff --git a/src/0283.Move-Zeroes/README.md b/src/0283.Move-Zeroes/README.md
@@ -0,0 +1,24 @@
+# [283. Move Zeroes][title]
+
+## Description
+
+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:**
+
+```
+Input: [0,1,0,3,12]
+Output: [1,3,12,0,0]
+```
+
+## NOTES
+-  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/
+
diff --git a/src/0283.Move-Zeroes/Solution.go b/src/0283.Move-Zeroes/Solution.go
@@ -0,0 +1,16 @@
+package Solution
+
+func moveZeroes(nums []int) []int {
+	count := 0
+	for _, i := range nums {
+		if i != 0 {
+			nums[count] = i
+			count++
+		}
+	}
+	for i := count; i < len(nums); i++ {
+		temp := i
+		nums[temp] = 0
+	}
+	return nums
+}
diff --git a/src/0283.Move-Zeroes/Solution_test.go b/src/0283.Move-Zeroes/Solution_test.go
@@ -0,0 +1,26 @@
+package Solution
+
+import (
+	"reflect"
+	"testing"
+)
+
+func TestMoveZeroes(t *testing.T) {
+	cases := []struct {
+		name    string
+		inputs  []int
+		expects []int
+	}{
+		{"test case 1", []int{0, 1, 0, 3, 12}, []int{1, 3, 12, 0, 0}},
+	}
+
+	for _, testcase := range cases {
+		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)
+			}
+
+		})
+	}
+}
