Using go modules to manage godeps

Author: beyondyyh

.gitignore

@@ -11,3 +11,4 @@
 
 # Output of the go coverage tool, specifically when used with LiteIDE
 *.out
+vendor

algorithms/binarysearch/69.mySqrt_test.go

@@ -1,26 +1,25 @@
 package binarysearch
 
-import "testing"
+import (
+	"testing"
+
+	"Leetcode/algorithms/kit"
+)
 
 // run: go test -v 69.*
 func Test_mySqrt(t *testing.T) {
-	cases := []struct {
-		name            string
-		input, expected int
-	}{
-		{"x0", 1, 1},
-		{"x1", 2, 1},
-		{"x2", 4, 2},
-		{"x3", 5, 2},
-		{"x4", 8, 2},
-		{"x5", 9, 3},
-		{"x6", 100, 10},
+	cases := []kit.CaseEntry{
+		{
+			Name:     "x1",
+			Input:    1,
+			Expected: 1,
+		},
 	}
 
 	for _, tt := range cases {
-		t.Run(tt.name, func(t *testing.T) {
-			if output := mySqrt(tt.input); output != tt.expected {
-				t.Errorf("mySqrt(%d)=%d, expected=%d", tt.input, output, tt.expected)
+		t.Run(tt.Name, func(t *testing.T) {
+			if output := mySqrt(tt.Input.(int)); output != tt.Expected.(int) {
+				t.Errorf("mySqrt(%d)=%d, expected=%d", tt.Input, output, tt.Expected)
 			}
 		})
 	}

algorithms/linkedList/141.hasCycle_test.go

@@ -3,7 +3,7 @@ package linkedList
 import (
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type (

algorithms/linkedList/148.sortList_test.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/stretchr/testify/assert"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v base.go 148.*

algorithms/linkedList/19.removeNthFromEnd_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type (

algorithms/linkedList/2.addTwoNumbers_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v base.go 2.*

algorithms/linkedList/206.reverseList.go

@@ -3,7 +3,7 @@ package linkedList
 import (
 	"fmt"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 func reverseList(head *ListNode) *ListNode {

algorithms/linkedList/206.reverseList_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v base.go 206.*

algorithms/linkedList/21.mergeTwoSortedLists_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v base.go 21.*

algorithms/linkedList/234.isPalindrome.go

@@ -3,7 +3,7 @@ package linkedList
 import (
 	"fmt"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 func isPalindrome(head *ListNode) bool {

algorithms/linkedList/234.isPalindrome_test.go

@@ -3,7 +3,7 @@ package linkedList
 import (
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v base.go 234.*

algorithms/linkedList/237.deleteNode_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type (

algorithms/linkedList/base.go

@@ -1,7 +1,7 @@
 package linkedList
 
 import (
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type ListNode = kit.ListNode

algorithms/myarray/11.maxArea_test.go

@@ -3,7 +3,7 @@ package myarray
 import (
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 func Test_maxArea(t *testing.T) {

algorithms/myarray/118.generate_test.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/stretchr/testify/assert"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // go test -v 118.*

algorithms/myarray/1213.arraysIntersection_test.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/stretchr/testify/assert"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v 1213.*

algorithms/myarray/15.threeSum_test.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/stretchr/testify/assert"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v 15.*

algorithms/myarray/33.search_test.go

@@ -3,7 +3,7 @@ package myarray
 import (
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type entry33input struct {

algorithms/myarray/34.searchRange_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type entry34input struct {

algorithms/myarray/442.findDuplicates_test.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/stretchr/testify/assert"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v 442.*

algorithms/myarray/509.fibnacci_test.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/stretchr/testify/assert"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v 509.*

algorithms/myarray/53.maxSubArray_test.go

@@ -5,7 +5,7 @@ import (
 
 	"github.com/stretchr/testify/assert"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v 53.*

algorithms/myheap/base.go

@@ -1,7 +1,7 @@
 package myheap
 
 import (
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type MinHeap = kit.MinHeap

algorithms/myqueue/933.RecentCounter.go

@@ -1,7 +1,7 @@
 package myqueue
 
 import (
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // 题目：最近的请求次数 https://leetcode-cn.com/problems/number-of-recent-calls/

algorithms/mystack/1021.removeOuterParentheses.go

@@ -1,6 +1,6 @@
 package mystack
 
-import "gopl.io/interview2020/Leetcode/algorithms/kit"
+import "Leetcode/algorithms/kit"
 
 // removeOuterParentheses remove the outer parentheses of S
 func removeOuterParentheses(S string) string {

algorithms/mystack/155.minStack.go

@@ -1,6 +1,6 @@
 package mystack
 
-import "gopl.io/interview2020/Leetcode/algorithms/kit"
+import "Leetcode/algorithms/kit"
 
 // MinStack declare
 type MinStack struct {

algorithms/mystack/173.BSTIterator.go

@@ -1,6 +1,6 @@
 package mystack
 
-import "gopl.io/interview2020/Leetcode/algorithms/kit"
+import "Leetcode/algorithms/kit"
 
 // https://leetcode-cn.com/problems/binary-search-tree-iterator/
 //		7

algorithms/mystack/173.BSTIterator_test.go

@@ -3,7 +3,7 @@ package mystack
 import (
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 
 	"github.com/stretchr/testify/assert"
 )

algorithms/mystack/225.myStack.go

@@ -3,7 +3,7 @@ package mystack
 import (
 	_ "fmt"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // MyStack Declare

algorithms/mystack/232.myQueue.go

@@ -1,6 +1,6 @@
 package mystack
 
-import "gopl.io/interview2020/Leetcode/algorithms/kit"
+import "Leetcode/algorithms/kit"
 
 // problem: https://leetcode-cn.com/problems/implement-queue-using-stacks/
 // 使用栈实现队列的下列操作：

algorithms/mystack/base.go

@@ -1,7 +1,7 @@
 package mystack
 
 import (
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 var NULL = kit.NULL

algorithms/mystring/20.isValid.go

@@ -1,6 +1,6 @@
 package mystring
 
-import "gopl.io/interview2020/Leetcode/algorithms/kit"
+import "Leetcode/algorithms/kit"
 
 // isValid1 based on stack
 func isValid1(s string) bool { // {{{

algorithms/mystring/32.longestValidParentheses.go

@@ -4,7 +4,7 @@ import (
 	"fmt"
 	"math"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // 此处默认s只包含 '(' 和 ')'

algorithms/mystring/71.simplifyPath.go

@@ -5,7 +5,7 @@ import (
 	"path/filepath"
 	"strings"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // 1. 用栈

algorithms/tree/101.isSymmetric_test.go

@@ -3,7 +3,7 @@ package tree
 import (
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // go test -v base.go 101.*

algorithms/tree/102.levelOrder_test.go

@@ -4,7 +4,7 @@ import (
 	_ "fmt"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // go test -v base.go 102.*

algorithms/tree/104.maxDepth_test.go

@@ -3,7 +3,7 @@ package tree
 import (
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v base.go 104.*

algorithms/tree/144.preorderTraversal.go

@@ -1,6 +1,6 @@
 package tree
 
-import "gopl.io/interview2020/Leetcode/algorithms/kit"
+import "Leetcode/algorithms/kit"
 
 // preorderTraversal 基于栈的前序遍历
 // 前序遍历顺序：根->左->右，在遍历左、右子树时，仍然先访问根结点，然后遍历左子树，最后遍历右子树

algorithms/tree/144.preorderTraversal_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type entry144 struct {

algorithms/tree/145.postorderTraversal.go

@@ -3,7 +3,7 @@ package tree
 import (
 	_ "fmt"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // postorderTraversal 基于栈的后序遍历

algorithms/tree/145.postorderTraversal_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 type entry145 struct {

algorithms/tree/226.invertTree_test.go

@@ -4,7 +4,7 @@ import (
 	"reflect"
 	"testing"
 
-	"gopl.io/interview2020/Leetcode/algorithms/kit"
+	"Leetcode/algorithms/kit"
 )
 
 // run: go test -v base.go 226.*