add some tests and go fmt

Author: emikhalev

Makefile

@@ -0,0 +1,2 @@
+test:
+	go test ./...

leetcode/3sum.go renamed to leetcode/3sum/3sum.go

@@ -1,5 +1,5 @@
 // https://leetcode.com/problems/3sum/
-package main
+package _sum
 
 import (
 	"sort"

leetcode/3sum/3sum_test.go

@@ -0,0 +1,30 @@
+package _sum
+
+import (
+	"reflect"
+	"testing"
+)
+
+func Test_threeSum(t *testing.T) {
+	cases := []struct {
+		params []int
+		exp    [][]int
+	}{
+		{
+			[]int{-1, 0, 1, 2, -1, -4}, [][]int{{-1, -1, 2}, {-1, 0, 1}},
+		},
+		{
+			[]int{-1, 0, 1, 2, -1, -4}, [][]int{{-1, -1, 2}, {-1, 0, 1}},
+		},
+		{
+			[]int{-1, 0, 1, 2, -1, -4}, [][]int{{-1, -1, 2}, {-1, 0, 1}},
+		},
+	}
+
+	for idx, tc := range cases {
+		out := threeSum(tc.params)
+		if !reflect.DeepEqual(out, tc.exp) {
+			t.Errorf("case %d error: got %v, expected %v", idx, out, tc.exp)
+		}
+	}
+}

leetcode/accounts_merge.go renamed to leetcode/accounts_merge/accounts_merge.go

@@ -1,5 +1,5 @@
 // https://leetcode.com/problems/accounts-merge/
-package main
+package accounts_merge
 
 import (
 	"sort"

leetcode/accounts_merge/accounts_merge_test.go

@@ -0,0 +1,29 @@
+package accounts_merge
+
+import (
+	"reflect"
+	"testing"
+)
+
+func Test_accountsMerge(t *testing.T) {
+	cases := []struct {
+		params [][]string
+		exp    [][]string
+	}{
+		{
+			[][]string{{"John", "[email protected]", "[email protected]"}, {"John", "[email protected]", "[email protected]"}, {"Mary", "[email protected]"}, {"John", "[email protected]"}},
+			[][]string{{"John", "[email protected]", "[email protected]", "[email protected]"}, {"Mary", "[email protected]"}, {"John", "[email protected]"}},
+		},
+		{
+			[][]string{{"Gabe", "[email protected]", "[email protected]", "[email protected]"}, {"Kevin", "[email protected]", "[email protected]", "[email protected]"}, {"Ethan", "[email protected]", "[email protected]", "[email protected]"}, {"Hanzo", "[email protected]", "[email protected]", "[email protected]"}, {"Fern", "[email protected]", "[email protected]", "[email protected]"}},
+			[][]string{{"Ethan", "[email protected]", "[email protected]", "[email protected]"}, {"Gabe", "[email protected]", "[email protected]", "[email protected]"}, {"Hanzo", "[email protected]", "[email protected]", "[email protected]"}, {"Kevin", "[email protected]", "[email protected]", "[email protected]"}, {"Fern", "[email protected]", "[email protected]", "[email protected]"}},
+		},
+	}
+
+	for idx, tc := range cases {
+		out := accountsMerge(tc.params)
+		if !reflect.DeepEqual(out, tc.exp) {
+			t.Errorf("case %d error: \n-- got: %v\n-- expected: %v", idx, out, tc.exp)
+		}
+	}
+}

leetcode/add_and_search_word_data_structure_design.go renamed to leetcode/add_and_search_word_data_structure_design/add_and_search_word_data_structure_design.go

@@ -1,5 +1,5 @@
 // https://leetcode.com/problems/add-and-search-word-data-structure-design/
-package main
+package add_and_search_word_data_structure_design
 
 type WordDictionary struct {
 	root *Node

leetcode/add_and_search_word_data_structure_design/add_and_search_word_data_structure_design_test.go

@@ -0,0 +1,22 @@
+package add_and_search_word_data_structure_design
+
+import (
+	"testing"
+)
+
+func TestWordDictionary(t *testing.T) {
+	wd := Constructor()
+	wd.AddWord("bad")
+	wd.AddWord("dad")
+	wd.AddWord("mad")
+	assert(t, wd.Search("pad") == false)
+	assert(t, wd.Search("bad"))
+	assert(t, wd.Search(".ad"))
+	assert(t, wd.Search("b.."))
+}
+
+func assert(t *testing.T, res bool) {
+	if !res {
+		t.Errorf("assert fails")
+	}
+}

leetcode/add_binary.go renamed to leetcode/add_binary/add_binary.go

@@ -1,5 +1,5 @@
 // https://leetcode.com/problems/add-binary/
-package main
+package add_binary
 
 func addBinary(a string, b string) string {
 	aIdxShift := 0

leetcode/add_binary/add_binary_test.go

@@ -0,0 +1,29 @@
+package add_binary
+
+import (
+	"reflect"
+	"testing"
+)
+
+func Test_addBinary(t *testing.T) {
+	cases := []struct {
+		params []string
+		exp    string
+	}{
+		{
+			[]string{"11", "1"},
+			"100",
+		},
+		{
+			[]string{"1010", "1011"},
+			"10101",
+		},
+	}
+
+	for idx, tc := range cases {
+		out := addBinary(tc.params[0], tc.params[1])
+		if !reflect.DeepEqual(out, tc.exp) {
+			t.Errorf("case %d error: got: %v, expected: %v", idx, out, tc.exp)
+		}
+	}
+}

leetcode/add_strings.go renamed to leetcode/add_strings/add_strings.go

@@ -1,5 +1,5 @@
 // https://leetcode.com/problems/add-strings/
-package main
+package add_strings
 
 func addStrings(num1 string, num2 string) string {
 	total := make([]byte, max(len(num1), len(num2))+1)

leetcode/add_strings/add_strings_test.go

@@ -0,0 +1,33 @@
+package add_strings
+
+import (
+	"reflect"
+	"testing"
+)
+
+func Test_addBinary(t *testing.T) {
+	cases := []struct {
+		params []string
+		exp    string
+	}{
+		{
+			[]string{"11", "123"},
+			"134",
+		},
+		{
+			[]string{"456", "77"},
+			"533",
+		},
+		{
+			[]string{"0", "0"},
+			"0",
+		},
+	}
+
+	for idx, tc := range cases {
+		out := addStrings(tc.params[0], tc.params[1])
+		if !reflect.DeepEqual(out, tc.exp) {
+			t.Errorf("case %d error: got: %v, expected: %v", idx, out, tc.exp)
+		}
+	}
+}

leetcode/problems_remove_nth_node_from_end_of_list.go

@@ -12,13 +12,11 @@ package main
 func removeNthFromEnd(head *ListNode, n int) *ListNode {
 	current := head
 	cnt := 0
-	for ;current!=nil; {
+	for current != nil {
 		current = current.Next
 		cnt++
 	}
 
-
-
 	nPos := cnt - n - 1
 	if nPos == -1 {
 		return head.Next
@@ -27,9 +25,8 @@ func removeNthFromEnd(head *ListNode, n int) *ListNode {
 		return nil
 	}
 
-
 	current = head
-	for i:=0; i<nPos; i++ {
+	for i := 0; i < nPos; i++ {
 		current = current.Next
 	}
 
@@ -39,4 +36,3 @@ func removeNthFromEnd(head *ListNode, n int) *ListNode {
 
 	return head
 }
-