Merge pull request halfrost#33 from halfrost/test_travis-ci

change path

Author: halfrost

.travis.yml

@@ -7,7 +7,6 @@ go:
 branches:
   only:
   - master
-  - stable
 
 script:
   - go get -t -v ./...

.vscode/launch.json

@@ -0,0 +1,17 @@
+{
+    // 使用 IntelliSense 了解相关属性。 
+    // 悬停以查看现有属性的描述。
+    // 欲了解更多信息，请访问: https://go.microsoft.com/fwlink/?linkid=830387
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "name": "Launch",
+            "type": "go",
+            "request": "launch",
+            "mode": "auto",
+            "program": "${fileDirname}",
+            "env": {},
+            "args": []
+        }
+    ]
+}

Algorithms/0002. Add Two Numbers/2. Add Two Numbers.go

@@ -1,12 +1,20 @@
 package leetcode
 
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
 /**
  * Definition for singly-linked list.
  * type ListNode struct {
  *     Val int
  *     Next *ListNode
  * }
  */
+
 func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
 	if l1 == nil || l2 == nil {
 		return nil

Algorithms/0002. Add Two Numbers/2. Add Two Numbers_test.go

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question2 struct {
@@ -73,7 +75,7 @@ func Test_Problem2(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans2, q.para2
-		fmt.Printf("【input】:%v       【output】:%v\n", p, L2s(addTwoNumbers(S2l(p.one), S2l(p.another))))
+		fmt.Printf("【input】:%v       【output】:%v\n", p, structures.List2Ints(addTwoNumbers(structures.Ints2List(p.one), structures.Ints2List(p.another))))
 	}
 	fmt.Printf("\n\n\n")
 }

Algorithms/0003. Longest Substring Without Repeating Characters/3. Longest Substring Without Repeating Characters.go

@@ -20,3 +20,10 @@ func lengthOfLongestSubstring(s string) int {
 	}
 	return result
 }
+
+func max(a int, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

Algorithms/0004. Median of Two Sorted Arrays/4. Median of Two Sorted Arrays.go

@@ -41,3 +41,17 @@ func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
 	}
 	return float64(midLeft+midRight) / 2
 }
+
+func max(a int, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a int, b int) int {
+	if a > b {
+		return b
+	}
+	return a
+}

Algorithms/0019. Remove Nth Node From End of List/19. Remove Nth Node From End of List.go

@@ -1,5 +1,12 @@
 package leetcode
 
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
 /**
  * Definition for singly-linked list.
  * type ListNode struct {

Algorithms/0019. Remove Nth Node From End of List/19. Remove Nth Node From End of List_test.go

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question19 struct {
@@ -50,23 +52,13 @@ func Test_Problem19(t *testing.T) {
 			para19{[]int{1, 2, 3, 4, 5}, 5},
 			ans19{[]int{2, 3, 4, 5}},
 		},
-
-		question19{
-			para19{[]int{1, 2, 3, 4, 5}, 0},
-			ans19{[]int{1, 2, 3, 4, 5}},
-		},
-
-		question19{
-			para19{[]int{1, 2, 3, 4, 5}, 10},
-			ans19{[]int{1, 2, 3, 4, 5}},
-		},
 	}
 
 	fmt.Printf("------------------------Leetcode Problem 19------------------------\n")
 
 	for _, q := range qs {
 		_, p := q.ans19, q.para19
-		fmt.Printf("【input】:%v       【output】:%v\n", p, L2s(removeNthFromEnd(S2l(p.one), p.n)))
+		fmt.Printf("【input】:%v       【output】:%v\n", p, structures.List2Ints(removeNthFromEnd(structures.Ints2List(p.one), p.n)))
 	}
 	fmt.Printf("\n\n\n")
 }

Algorithms/0021. Merge Two Sorted Lists/21. Merge Two Sorted Lists.go

@@ -1,5 +1,12 @@
 package leetcode
 
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// ListNode define
+type ListNode = structures.ListNode
+
 /**
  * Definition for singly-linked list.
  * type ListNode struct {

Algorithms/0021. Merge Two Sorted Lists/21. Merge Two Sorted Lists_test.go

@@ -3,6 +3,8 @@ package leetcode
 import (
 	"fmt"
 	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
 )
 
 type question21 struct {
@@ -73,7 +75,7 @@ func Test_Problem21(t *testing.T) {
 
 	for _, q := range qs {
 		_, p := q.ans21, q.para21
-		fmt.Printf("【input】:%v       【output】:%v\n", p, L2s(mergeTwoLists(S2l(p.one), S2l(p.another))))
+		fmt.Printf("【input】:%v       【output】:%v\n", p, structures.List2Ints(mergeTwoLists(structures.Ints2List(p.one), structures.Ints2List(p.another))))
 	}
 	fmt.Printf("\n\n\n")
 }