添加leet_code

Author: hero

leet_code/add-two-numbers_test.go

@@ -5,25 +5,17 @@ import (
 )
 
 func TestAddTwoNumbers(t *testing.T) {
-	t.Log(addTwoNumbers(&ListNode{
-		Val: 2,
-		Next: &ListNode{
-			Val: 4,
-			Next: &ListNode{
-				Val:  3,
-				Next: nil,
-			},
-		},
+	info := addTwoNumbers(&ListNode{
+		Val:  5,
+		Next: nil,
 	}, &ListNode{
-		Val: 5,
-		Next: &ListNode{
-			Val: 6,
-			Next: &ListNode{
-				Val:  4,
-				Next: nil,
-			},
-		},
-	}))
+		Val:  5,
+		Next: nil,
+	})
+	for info != nil {
+		t.Log(info.Val)
+		info = info.Next
+	}
 }
 
 type ListNode struct {
@@ -34,5 +26,37 @@ type ListNode struct {
 //两数相加
 func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
 	var data = new(ListNode)
-	return data
+	var curr = data
+	var less int
+	for l1 != nil || l2 != nil {
+		var (
+			x   int = 0
+			y   int = 0
+			sum     = 0
+		)
+		if l1 != nil {
+			x = l1.Val
+		}
+		if l2 != nil {
+			y = l2.Val
+		}
+		sum = less + x + y
+		less = sum / 10
+		if l1 != nil {
+			l1 = l1.Next
+		}
+		if l2 != nil {
+			l2 = l2.Next
+		}
+		curr.Next = &ListNode{Val: sum % 10}
+		curr = curr.Next
+
+	}
+	if less > 0 {
+		curr.Next = &ListNode{
+			Val:  less,
+			Next: nil,
+		}
+	}
+	return data.Next
 }

leet_code/lengthOfLongestSubstring_test.go

@@ -0,0 +1,22 @@
+package leet_code
+
+import (
+	"testing"
+)
+
+func TestLengthOfLongestSubstring(t *testing.T) {
+	t.Log(lengthOfLongestSubstring("abcabcbb"))
+}
+
+type Data struct {
+	Index int
+	Val   int
+	have  bool
+}
+
+func lengthOfLongestSubstring(s string) int {
+	if len(s) == 0 {
+		return 0
+	}
+	return 0
+}

leet_code/two-sum_test.go

@@ -5,7 +5,7 @@ import (
 )
 
 func TestTwoSum(t *testing.T) {
-	t.Log(twoSum([]int{2, 7, 11, 15}, 6))
+	t.Log(twoSum([]int{2, 7, 11, 15}, 9))
 }
 
 //两数相和

linked_list/double_list.go

@@ -117,6 +117,16 @@ func (l *DoubleList) GetAll() []interface{} {
 	return data
 }
 
+func (l *DoubleList) GetAllV2() []interface{} {
+	var data []interface{}
+	node := l.Head
+	for node != nil {
+		data = append(data, node.Data)
+		node = node.Next
+	}
+	return data
+}
+
 func (l *DoubleList) GetHead() *DoubleNode {
 	return l.Head
 }

linked_list/double_list_test.go

@@ -14,6 +14,7 @@ func TestNewDoubleList(t *testing.T) {
 		Data: 10,
 	})
 	t.Log(l.GetAll())
+	t.Log(l.GetAllV2())
 	t.Log(l.Get(3))
 	t.Log(l.InsertNext(l.Get(2), &DoubleNode{
 		Data: 11,