finish: 66 and 88

Author: pengliheng

coverage.txt

@@ -349,6 +349,13 @@ www/leetcode/kit/31.NextPermutation/main.go:12.13,16.4 3 1
 www/leetcode/kit/31.NextPermutation/main.go:20.27,22.3 1 3
 www/leetcode/kit/31.NextPermutation/main.go:24.12,28.3 3 3
 mode: atomic
+www/leetcode/kit/35.SearchInsertPosition/main.go:3.47,4.22 1 4
+www/leetcode/kit/35.SearchInsertPosition/main.go:7.2,7.33 1 3
+www/leetcode/kit/35.SearchInsertPosition/main.go:12.2,12.18 1 1
+www/leetcode/kit/35.SearchInsertPosition/main.go:4.22,6.3 1 1
+www/leetcode/kit/35.SearchInsertPosition/main.go:7.33,8.24 1 9
+www/leetcode/kit/35.SearchInsertPosition/main.go:8.24,10.4 1 2
+mode: atomic
 www/leetcode/kit/4.FindMedianSortedArrays/main.go:3.63,5.34 2 4
 www/leetcode/kit/4.FindMedianSortedArrays/main.go:12.2,12.23 1 4
 www/leetcode/kit/4.FindMedianSortedArrays/main.go:5.34,6.37 1 11
@@ -387,6 +394,19 @@ www/leetcode/kit/6.ZigZagConversion/main.go:19.50,21.36 2 9
 www/leetcode/kit/6.ZigZagConversion/main.go:21.36,23.5 1 7
 www/leetcode/kit/6.ZigZagConversion/main.go:26.57,28.3 1 5
 mode: atomic
+www/leetcode/kit/66.PlusOne/main.go:5.34,7.40 2 2
+www/leetcode/kit/66.PlusOne/main.go:33.2,33.15 1 1
+www/leetcode/kit/66.PlusOne/main.go:7.40,10.15 1 4
+www/leetcode/kit/66.PlusOne/main.go:19.3,19.25 1 4
+www/leetcode/kit/66.PlusOne/main.go:28.3,28.25 1 4
+www/leetcode/kit/66.PlusOne/main.go:10.15,11.22 1 0
+www/leetcode/kit/66.PlusOne/main.go:11.22,13.5 1 0
+www/leetcode/kit/66.PlusOne/main.go:13.10,16.5 2 0
+www/leetcode/kit/66.PlusOne/main.go:19.25,20.34 1 2
+www/leetcode/kit/66.PlusOne/main.go:20.34,23.5 2 1
+www/leetcode/kit/66.PlusOne/main.go:23.10,25.5 1 1
+www/leetcode/kit/66.PlusOne/main.go:28.25,31.4 2 1
+mode: atomic
 www/leetcode/kit/7.ReverseInteger/main.go:7.25,10.11 3 7
 www/leetcode/kit/7.ReverseInteger/main.go:14.2,14.12 1 7
 www/leetcode/kit/7.ReverseInteger/main.go:19.2,20.49 2 7
@@ -411,6 +431,12 @@ www/leetcode/kit/8.StringToInteger/main.go:40.2,40.16 1 9
 www/leetcode/kit/8.StringToInteger/main.go:34.29,36.3 1 1
 www/leetcode/kit/8.StringToInteger/main.go:37.29,39.3 1 1
 mode: atomic
+www/leetcode/kit/88.MergeSortedArray/main.go:3.58,6.39 2 3
+www/leetcode/kit/88.MergeSortedArray/main.go:13.2,13.14 1 3
+www/leetcode/kit/88.MergeSortedArray/main.go:6.39,7.43 1 10
+www/leetcode/kit/88.MergeSortedArray/main.go:7.43,8.34 1 30
+www/leetcode/kit/88.MergeSortedArray/main.go:8.34,10.14 1 10
+mode: atomic
 www/leetcode/kit/9.PalindromeNumber/main.go:7.31,9.20 2 2
 www/leetcode/kit/9.PalindromeNumber/main.go:14.2,14.13 1 1
 www/leetcode/kit/9.PalindromeNumber/main.go:9.20,10.49 1 4

interview.md

@@ -1,5 +1,6 @@
-### 采访一位刷了1000道leetcode的[大佬](https://github.com/aQuaYi/LeetCode-in-Go)
-```
+# 采访一位刷了 1000 道 leetcode 的[大佬](https://github.com/aQuaYi/LeetCode-in-Go)
+
+```bash
 ali peng, [16.02.19 15:34]
 大佬您好, 看到您用golang的刷题记录, 感觉真的很棒,特地来电报膜拜一下
 
@@ -29,4 +30,5 @@ ali peng, [18.02.19 22:53]
 ```
 
 ### 结论
+
 刷题能极大地提高编码能力

kit/35.SearchInsertPosition/README.md

@@ -0,0 +1,5 @@
+# [35. Search Insert Position](https://leetcode.com/problems/search-insert-position/)
+
+## 2019/04/24
+
+### 题目 💗[easy]

kit/35.SearchInsertPosition/main.go

@@ -0,0 +1,13 @@
+package searchInsert
+
+func searchInsert(nums []int, target int) int {
+	if target < nums[0] {
+		return 0
+	}
+	for i := 0; i < len(nums); i++ {
+		if nums[i] >= target {
+			return i
+		}
+	}
+	return len(nums)
+}

kit/35.SearchInsertPosition/main_test.go

@@ -0,0 +1,72 @@
+package searchInsert
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type para struct {
+	one []int
+	two int
+}
+
+type ans struct {
+	one int
+}
+
+type question struct {
+	p para
+	a ans
+}
+
+func Test_OK(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+		question{
+			p: para{
+				one: []int{1, 3, 5, 6},
+				two: 5,
+			},
+			a: ans{
+				one: 2,
+			},
+		},
+		question{
+			p: para{
+				one: []int{1, 3, 5, 6},
+				two: 2,
+			},
+			a: ans{
+				one: 1,
+			},
+		},
+		question{
+			p: para{
+				one: []int{1, 3, 5, 6},
+				two: 7,
+			},
+			a: ans{
+				one: 4,
+			},
+		},
+		question{
+			p: para{
+				one: []int{1, 3, 5, 6},
+				two: 0,
+			},
+			a: ans{
+				one: 0,
+			},
+		},
+	}
+
+	for _, q := range qs {
+		a, p := q.a, q.p
+		ast.Equal(a.one, searchInsert(p.one, p.two), "输入:%v", p)
+	}
+
+	// ast.Panics(func() { longestPalindrome([]int{}, []int{}) }, "对空切片求中位数，却没有panic")
+
+}

kit/66.PlusOne/README.md

@@ -0,0 +1,5 @@
+# [66. Plus One](https://leetcode-cn.com/problems/plus-one/submissions/)
+
+## 2019/04/25
+
+### 题目 💗[easy]

kit/66.PlusOne/main.go

@@ -0,0 +1,34 @@
+package plusOne
+
+// [1,2,9]
+// [1,3,0]
+func plusOne(digits []int) []int {
+	addLevel := false
+	for i := len(digits) - 1; i >= 0; i-- {
+
+		// 如果需要进位
+		if addLevel {
+			if digits[i] == 9 {
+				digits[i] = 0
+			} else {
+				digits[i]++
+				addLevel = false
+			}
+		}
+		// 首位
+		if i == len(digits)-1 {
+			if digits[len(digits)-1] == 9 {
+				digits[len(digits)-1] = 0
+				addLevel = true
+			} else {
+				digits[len(digits)-1]++
+			}
+		}
+		// 如果是最后一位 , 但是 addLevel == true
+		if addLevel && i == 0 {
+			digits = append([]int{1}, digits...)
+			return digits
+		}
+	}
+	return digits
+}

kit/66.PlusOne/main_test.go

@@ -0,0 +1,52 @@
+package plusOne
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type para struct {
+	one []int
+	two int
+}
+
+type ans struct {
+	one []int
+}
+
+type question struct {
+	p para
+	a ans
+}
+
+func Test_OK(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+		question{
+			p: para{
+				one: []int{1, 2, 4},
+			},
+			a: ans{
+				one: []int{1, 2, 5},
+			},
+		},
+		question{
+			p: para{
+				one: []int{9},
+			},
+			a: ans{
+				one: []int{1, 0},
+			},
+		},
+	}
+
+	for _, q := range qs {
+		a, p := q.a, q.p
+		ast.Equal(a.one, plusOne(p.one), "输入:%v", p)
+	}
+
+	// ast.Panics(func() { longestPalindrome([]int{}, []int{}) }, "对空切片求中位数，却没有panic")
+
+}

kit/88.MergeSortedArray/README.md

@@ -0,0 +1,5 @@
+# [88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)
+
+## 2019/04/25
+
+### 题目 💗[easy]

kit/88.MergeSortedArray/main.go

@@ -0,0 +1,14 @@
+package merge
+
+func merge(nums1 []int, m int, nums2 []int, n int) []int {
+	nums1 = append(nums1[:m], nums2[:n]...)
+
+    for i := 0; i < len(nums1)-1; i++ {
+        for j := i+1; j < len(nums1); j++ {
+            if  nums1[i]>nums1[j]{
+                nums1[i],nums1[j] = nums1[j],nums1[i]
+            }
+        }
+    }
+	return nums1
+}

kit/88.MergeSortedArray/main_test.go

@@ -0,0 +1,71 @@
+package merge
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type para struct {
+	one   []int
+	two   int
+	three []int
+	four  int
+}
+
+type ans struct {
+	one []int
+}
+
+type question struct {
+	p para
+	a ans
+}
+
+func Test_OK(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+		question{
+			p: para{
+				one:   []int{4, 5, 6, 0, 0, 0},
+				two:   3,
+				three: []int{1, 2, 3},
+				four:  3,
+			},
+			a: ans{
+				one: []int{1, 2, 3, 4, 5, 6},
+			},
+		},
+		question{
+			p: para{
+				one:   []int{1, 2, 3, 0, 0, 0},
+				two:   3,
+				three: []int{2, 5, 6},
+				four:  3,
+			},
+			a: ans{
+				one: []int{1, 2, 2, 3, 5, 6},
+			},
+		},
+		question{
+			p: para{
+				one:   []int{1},
+				two:   1,
+				three: []int{1},
+				four:  0,
+			},
+			a: ans{
+				one: []int{1},
+			},
+		},
+	}
+
+	for _, q := range qs {
+		a, p := q.a, q.p
+		ast.Equal(a.one, merge(p.one, p.two, p.three, p.four), "输入:%v", p)
+	}
+
+	// ast.Panics(func() { longestPalindrome([]int{}, []int{}) }, "对空切片求中位数，却没有panic")
+
+}