update for docs

Author: Kyle Liu

SUMMARY.md

@@ -3,5 +3,5 @@
   * [Summary](SUMMARY-LIST.md)
   * [Contributor](CONTRIBUTOR.md)
   * Soutions(1-976)
-      {{ range . }}* [{{.PathName}}]({{.PathName}}/README.md)
+      {{ range . }}* [{{.PathName}}](leetcode/{{.PathName}}/README.md)
       {{ end }}

cmd/template/gitbook/SUMMARY.md

@@ -0,0 +1,62 @@
+# [1. Add Sum][title]
+
+## Description
+
+Given two binary strings, return their sum (also a binary string).
+
+The input strings are both **non-empty** and contains only characters `1` or `0`.
+
+**Example 1:**
+
+```
+Input: a = "11", b = "1"
+Output: "100"
+```
+
+**Example 2:**
+
+```
+Input: a = "1010", b = "1011"
+Output: "10101"
+```
+
+**Tags:** Math, String
+> [!NOTE|style:flat]
+> An alert of type 'note' using global style 'callout'.
+
+* 1
+> [!TIP|style:flat]
+> An alert of type 'note' using global style 'callout'.
+
+* 2
+
+> [!WARNING|style:flat]
+> An alert of type 'note' using global style 'callout'.
+
+
+
+
+## 题意
+>给你两个二进制串，求其和的二进制串。
+
+## 题解
+
+### 思路1
+> 按照小学算数那么来做，用 `carry` 表示进位，从后往前算，依次往前，每算出一位就插入到最前面即可，直到把两个二进制串都遍历完即可。
+
+```go
+
+```
+
+### 思路2
+> 思路2
+```go
+
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/two-sum/description/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/1-100/0001.Two-Sum/README.md

@@ -0,0 +1,54 @@
+package Solution
+
+func TwoSum1(nums []int, target int) []int {
+
+	n := len(nums)
+
+	for i, v := range nums {
+		for j := i + 1; j < n; j++ {
+			if v+nums[j] == target {
+				return []int{i, j}
+			}
+		}
+	}
+
+	return nil
+}
+
+func TwoSum2(nums []int, target int) []int {
+
+	m := make(map[int]int, len(nums))
+
+	for i, v := range nums {
+		sub := target - v
+		if j, ok := m[sub]; ok {
+			return []int{j, i}
+		} else {
+			m[v] = i
+		}
+	}
+
+	return nil
+}
+
+func TwoSum3(nums []int, target int) []int {
+	if nums == nil || len(nums) < 2 {
+		return []int{-1, -1}
+	}
+
+	res := []int{-1, -1}
+
+	//	MAP的KEY表示值，MAP的VAL表示nums的下标
+	intMap := map[int]int{}
+	for i := 0; i < len(nums); i++ {
+		//	判断MAP中是否纯在一个Key满足 KEY + nums[i] = target
+		//	如果满足则返回相关地址,不满足则将数组中的值PUSH到MAP
+		if _, ok := intMap[target-nums[i]]; ok {
+			res[0] = intMap[target-nums[i]]
+			res[1] = i
+			break
+		}
+		intMap[nums[i]] = i
+	}
+	return res
+}

leetcode/1-100/0001.Two-Sum/Solution.go

@@ -0,0 +1,110 @@
+package Solution
+
+import (
+	"math/rand"
+	"reflect"
+	"testing"
+)
+
+func TestTwoSum1(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs [][]int
+		expect []int
+	}{
+		{"1 test 1", [][]int{{2, 7, 11, 15}, {9}}, []int{0, 1}},
+		{"2 test 2", [][]int{{3, 2, 4}, {6}}, []int{1, 2}},
+		{"3 test 3", [][]int{{2, 7, 11, 15}, {9}}, []int{0, 1}},
+		{"4 test 4", [][]int{{7, 6, 5, 3, 2, 1, 4, 9, 10}, {17}}, []int{0, 8}},
+	}
+
+	//	开始测试
+	for _, c := range cases {
+		t.Run(c.name, func(t *testing.T) {
+			ret := TwoSum1(c.inputs[0], c.inputs[1][0])
+			if !reflect.DeepEqual(ret, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, ret, c.inputs)
+			}
+		})
+	}
+}
+
+func TestTwoSum2(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs [][]int
+		expect []int
+	}{
+		{"1 test 1", [][]int{{2, 7, 11, 15}, {9}}, []int{0, 1}},
+		{"2 test 2", [][]int{{3, 2, 4}, {6}}, []int{1, 2}},
+		{"3 test 3", [][]int{{2, 7, 11, 15}, {9}}, []int{0, 1}},
+		{"4 test 4", [][]int{{7, 6, 5, 3, 2, 1, 4, 9, 10}, {17}}, []int{0, 8}},
+	}
+
+	//	开始测试
+	for _, c := range cases {
+		t.Run(c.name, func(t *testing.T) {
+			ret := TwoSum2(c.inputs[0], c.inputs[1][0])
+			if !reflect.DeepEqual(ret, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, ret, c.inputs)
+			}
+		})
+	}
+}
+
+func TestTwoSum3(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs [][]int
+		expect []int
+	}{
+		{"1 test 1", [][]int{{2, 7, 11, 15}, {9}}, []int{0, 1}},
+		{"2 test 2", [][]int{{3, 2, 4}, {6}}, []int{1, 2}},
+		{"3 test 3", [][]int{{2, 7, 11, 15}, {9}}, []int{0, 1}},
+		{"4 test 4", [][]int{{7, 6, 5, 3, 2, 1, 4, 9, 10}, {17}}, []int{0, 8}},
+	}
+
+	//	开始测试
+	for _, c := range cases {
+		t.Run(c.name, func(t *testing.T) {
+			ret := TwoSum3(c.inputs[0], c.inputs[1][0])
+			if !reflect.DeepEqual(ret, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, ret, c.inputs)
+			}
+		})
+	}
+}
+
+const N = 100
+
+func BenchmarkTwoSum1(b *testing.B) {
+	nums := []int{}
+	for i := 0; i < N; i++ {
+		nums = append(nums, rand.Int())
+	}
+	nums = append(nums, 7, 2)
+
+	b.ResetTimer()
+	for i := 0; i < b.N; i++ {
+		TwoSum1(nums, 9)
+	}
+}
+
+func BenchmarkTwoSum2(b *testing.B) {
+	nums := []int{}
+	for i := 0; i < N; i++ {
+		nums = append(nums, rand.Int())
+	}
+	nums = append(nums, 7, 2)
+
+	b.ResetTimer()
+	for i := 0; i < b.N; i++ {
+		TwoSum2(nums, 9)
+	}
+}

leetcode/1-100/0001.Two-Sum/Solution_test.go

@@ -0,0 +1,25 @@
+package Solution
+
+type ListNode struct {
+	Val  int
+	Next *ListNode
+}
+
+//	比较结果
+func isEqual(l1 *ListNode, l2 *ListNode) bool {
+
+	for l1 != nil && l2 != nil {
+		if l1.Val != l2.Val {
+			return false
+		}
+		l1 = l1.Next
+		l2 = l2.Next
+	}
+	if l1 == nil && l2 != nil {
+		return false
+	}
+	if l1 != nil && l2 == nil {
+		return false
+	}
+	return true
+}

leetcode/1-100/0002.Add-Two-Numbers/ListNode.go

@@ -0,0 +1,67 @@
+# [2. Add Two Numbers][title]
+
+## Description
+
+You are given two **non-empty** linked lists representing two non-negative integers. The digits are stored in **reverse order** and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
+
+You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+
+**Example**
+
+```
+Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
+Output: 7 -> 0 -> 8
+Explanation: 342 + 465 = 807.
+```
+
+**Tags:** Linked List, Math
+
+## 题意
+>以链表表示一个数，低位在前，高位在后，所以题中的例子就是 342 + 465 = 807.
+
+## 题解
+
+### 思路1
+> 直接模拟计算就好
+
+```golang
+func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
+	node := &ListNode{Val: 0, Next: nil}
+	n1, n2, tmp := l1, l2, node
+	sum := 0
+	
+	for n1 != nil || n2 != nil {
+		sum /= 10
+		if n1 != nil {
+			sum += n1.Val
+			n1 = n1.Next
+
+		}
+		if n2 != nil {
+			sum += n2.Val
+			n2 = n2.Next
+		}
+		tmp.Next = &ListNode{Val: sum % 10}
+		tmp = tmp.Next
+	}
+	if sum/10 != 0 {
+		tmp.Next = &ListNode{Val: 1}
+	}
+	return node.Next
+}
+
+
+```
+
+### 思路2
+> 思路2
+```go
+
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/add-two-numbers/description/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm

leetcode/1-100/0002.Add-Two-Numbers/README.md

@@ -0,0 +1,26 @@
+package Solution
+
+func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode {
+	node := &ListNode{Val: 0, Next: nil}
+	n1, n2, tmp := l1, l2, node
+	sum := 0
+
+	for n1 != nil || n2 != nil {
+		sum /= 10
+		if n1 != nil {
+			sum += n1.Val
+			n1 = n1.Next
+
+		}
+		if n2 != nil {
+			sum += n2.Val
+			n2 = n2.Next
+		}
+		tmp.Next = &ListNode{Val: sum % 10}
+		tmp = tmp.Next
+	}
+	if sum/10 != 0 {
+		tmp.Next = &ListNode{Val: 1}
+	}
+	return node.Next
+}

leetcode/1-100/0002.Add-Two-Numbers/Solution.go

@@ -0,0 +1,32 @@
+package Solution
+
+import (
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		input1 *ListNode
+		input2 *ListNode
+		expect *ListNode
+	}{
+		{"Test Case ",
+			&ListNode{Val: 2, Next: &ListNode{Val: 4, Next: &ListNode{Val: 3, Next: nil}}},
+			&ListNode{Val: 5, Next: &ListNode{Val: 6, Next: &ListNode{Val: 4, Next: nil}}},
+			&ListNode{Val: 7, Next: &ListNode{Val: 0, Next: &ListNode{Val: 8, Next: nil}}}},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+strconv.Itoa(i), func(t *testing.T) {
+			got := addTwoNumbers(c.input1, c.input2)
+			if !isEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.input1)
+			}
+		})
+	}
+}