add tests

Author: kakugirai

.travis.yml

@@ -1,7 +1,6 @@
 language: go
 
 go:
-  - 1.11.x
   - 1.12.x
 
 script:

src/same-tree/solution_test.go

@@ -0,0 +1,31 @@
+package main
+
+import "testing"
+
+func Test_isSameTree(t *testing.T) {
+	type args struct {
+		p *TreeNode
+		q *TreeNode
+	}
+	tests := []struct {
+		name string
+		args args
+		want bool
+	}{
+		{
+			"1",
+			args{
+				&TreeNode{1, nil, nil},
+				&TreeNode{1, nil, nil},
+			},
+			true,
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := isSameTree(tt.args.p, tt.args.q); got != tt.want {
+				t.Errorf("isSameTree() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

src/search-in-rotated-sorted-array/solution_test.go

@@ -0,0 +1,28 @@
+package main
+
+import "testing"
+
+func Test_search(t *testing.T) {
+	type args struct {
+		nums   []int
+		target int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			"1",
+			args{[]int{4, 5, 6, 7, 0, 1, 2}, 1},
+			5,
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := search(tt.args.nums, tt.args.target); got != tt.want {
+				t.Errorf("search() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

src/search-insert-position/solution.go

@@ -2,12 +2,6 @@ package main
 
 import "fmt"
 
-func main() {
-	nums := []int{1, 3, 5, 6}
-	target := 5
-	fmt.Println(searchInsert(nums, target))
-}
-
 func searchInsert(nums []int, target int) int {
 	if len(nums) == 0 {
 		return -1
@@ -46,3 +40,9 @@ func searchInsert(nums []int, target int) int {
 
 	return start + 1
 }
+
+func main() {
+	nums := []int{1, 3, 5, 6}
+	target := 5
+	fmt.Println(searchInsert(nums, target))
+}

src/search-insert-position/solution_test.go

@@ -0,0 +1,28 @@
+package main
+
+import "testing"
+
+func Test_searchInsert(t *testing.T) {
+	type args struct {
+		nums   []int
+		target int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			"1",
+			args{[]int{1, 3, 5, 6}, 5},
+			2,
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := searchInsert(tt.args.nums, tt.args.target); got != tt.want {
+				t.Errorf("searchInsert() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

src/single-number-ii/solution_test.go

@@ -0,0 +1,27 @@
+package main
+
+import "testing"
+
+func Test_singleNumber(t *testing.T) {
+	type args struct {
+		nums []int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			"1",
+			args{[]int{0, 1, 0, 1, 0, 1, 99}},
+			99,
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := singleNumber(tt.args.nums); got != tt.want {
+				t.Errorf("singleNumber() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

src/single-number/solution_test.go

@@ -0,0 +1,27 @@
+package main
+
+import "testing"
+
+func Test_singleNumber(t *testing.T) {
+	type args struct {
+		nums []int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			"1",
+			args{[]int{4, 1, 2, 1, 2}},
+			4,
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := singleNumber(tt.args.nums); got != tt.want {
+				t.Errorf("singleNumber() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

src/sort-array-by-parity/solution.go

@@ -19,5 +19,5 @@ func sortArrayByParity(A []int) []int {
 }
 
 func main() {
-	fmt.Println(sortArrayByParity([]int{3, 1, 2, 4}))
+	fmt.Printf("%#v", sortArrayByParity([]int{3, 1, 2, 4}))
 }

src/sort-array-by-parity/solution_test.go

@@ -0,0 +1,30 @@
+package main
+
+import (
+	"reflect"
+	"testing"
+)
+
+func Test_sortArrayByParity(t *testing.T) {
+	type args struct {
+		A []int
+	}
+	tests := []struct {
+		name string
+		args args
+		want []int
+	}{
+		{
+			"1",
+			args{[]int{3, 1, 2, 4}},
+			[]int{2, 4, 1, 3},
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := sortArrayByParity(tt.args.A); !reflect.DeepEqual(got, tt.want) {
+				t.Errorf("sortArrayByParity() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

src/sort-characters-by-frequency/solution.go

@@ -28,7 +28,7 @@ func frequencySort(s string) string {
 		freq[s[i]]++
 	}
 
-	// strs := [ttt ee r]
+	//strs := []string{"ttt", "ee", "r"}
 	var strs []string
 	for i := range freq {
 		if freq[i] == 0 {
@@ -54,5 +54,5 @@ func frequencySort(s string) string {
 }
 
 func main() {
-	fmt.Println(frequencySort("tttree"))
+	fmt.Printf("%#v", frequencySort("tttree"))
 }

src/sort-characters-by-frequency/solution_test.go

@@ -0,0 +1,27 @@
+package main
+
+import "testing"
+
+func Test_frequencySort(t *testing.T) {
+	type args struct {
+		s string
+	}
+	tests := []struct {
+		name string
+		args args
+		want string
+	}{
+		{
+			"1",
+			args{"tttree"},
+			"ttteer",
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := frequencySort(tt.args.s); got != tt.want {
+				t.Errorf("frequencySort() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

src/sqrtx/solution_test.go

@@ -0,0 +1,27 @@
+package main
+
+import "testing"
+
+func Test_mySqrt(t *testing.T) {
+	type args struct {
+		x int
+	}
+	tests := []struct {
+		name string
+		args args
+		want int
+	}{
+		{
+			"1",
+			args{9},
+			3,
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := mySqrt(tt.args.x); got != tt.want {
+				t.Errorf("mySqrt() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}

src/subsets/solution.go

@@ -24,5 +24,5 @@ func generateSubsets(nums []int, idx int, curr *[]int, result *[][]int) {
 
 func main() {
 	nums := []int{1, 2, 3}
-	fmt.Println(subsets(nums))
+	fmt.Printf("%#v", subsets(nums))
 }

src/subsets/solution_test.go

@@ -0,0 +1,30 @@
+package main
+
+import (
+	"reflect"
+	"testing"
+)
+
+func Test_subsets(t *testing.T) {
+	type args struct {
+		nums []int
+	}
+	tests := []struct {
+		name string
+		args args
+		want [][]int
+	}{
+		{
+			"1",
+			args{[]int{1, 2, 3}},
+			[][]int{{}, {1}, {1, 2}, {1, 2, 3}, {1, 3}, {2}, {2, 3}, {3}},
+		},
+	}
+	for _, tt := range tests {
+		t.Run(tt.name, func(t *testing.T) {
+			if got := subsets(tt.args.nums); !reflect.DeepEqual(got, tt.want) {
+				t.Errorf("subsets() = %v, want %v", got, tt.want)
+			}
+		})
+	}
+}