Merge branch 'develop'

Author: 6boris

SUMMARY.md

@@ -108,11 +108,15 @@
       * [0104.Maximum-Depth-of-Binary-Tree](./src/0104.Maximum-Depth-of-Binary-Tree/README.md)
       * [0107.Binary-Tree-Level-Order-Traversal-II](./src/0107.Binary-Tree-Level-Order-Traversal-II/README.md)
       * [0120.Triangle](./src/0120.Triangle/README.md)
+      * [0121.Best-Time-to-Buy-and-Sell-Stock](./src/0121.Best-Time-to-Buy-and-Sell-Stock/README.md)
+      * [0122.Best-Time-to-Buy-and-Sell-Stock-II](./src/0122.Best-Time-to-Buy-and-Sell-Stock-II/README.md)
+      * [0123.Best-Time-to-Buy-and-Sell-Stock-III](./src/0123.Best-Time-to-Buy-and-Sell-Stock-III/README.md)
       * [0141.Linked-List-Cycle](./src/0141.Linked-List-Cycle/README.md)
       * [0142.Linked-List-Cycle-II](./src/0142.Linked-List-Cycle-II/README.md)
       * [0144.Binary-Tree-Preorder-Traversal](./src/0144.Binary-Tree-Preorder-Traversal/README.md)
       * [0145.Binary-Tree-Postorder-Traversal](./src/0145.Binary-Tree-Postorder-Traversal/README.md)
       * [0169.Majority-Element](./src/0169.Majority-Element/README.md)
+      * [0188.Best-Time-to-Buy-and-Sell-Stock-IV](./src/0188.Best-Time-to-Buy-and-Sell-Stock-IV/README.md)
       * [0198.House-Robber](./src/0198.House-Robber/README.md)
       * [0206.Reverse-Linked-List](./src/0206.Reverse-Linked-List/README.md)
       * [0216.Combination-Sum-III](./src/0216.Combination-Sum-III/README.md)
@@ -122,7 +126,10 @@
       * [0236.Lowest-Common-Ancestor-of-a-Binary-Tree](./src/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/README.md)
       * [0242.Valid-Anagram](./src/0242.Valid-Anagram/README.md)
       * [0300.Longest-Increasing-Subsequence](./src/0300.Longest-Increasing-Subsequence/README.md)
+      * [0376.Wiggle-Subsequence](./src/0376.Wiggle-Subsequence/README.md)
       * [0377.Combination-Sum-IV](./src/0377.Combination-Sum-IV/README.md)
+      * [0412.Fizz-Buzz](./src/0412.Fizz-Buzz/README.md)
+      * [0455.Assign-Cookies](./src/0455.Assign-Cookies/README.md)
       * [0554.Brick-Wall](./src/0554.Brick-Wall/README.md)
       * [0703.Kth-Largest-Element-in-a-Stream](./src/0703.Kth-Largest-Element-in-a-Stream/README.md)
       * [0980.Unique-Paths-III](./src/0980.Unique-Paths-III/README.md)

assets/images/376_Wiggle_Subsequence.jpg

@@ -1,19 +1,16 @@
 package github
 
 import (
-	"encoding/json"
-	"fmt"
 	"testing"
 )
 
 func TestGetContributorString(t *testing.T) {
-	con_buffer := getContributorBufer()
-	contributors := []Contributor{}
-	err := json.Unmarshal(con_buffer, &contributors)
-	if err != nil {
-		fmt.Println(err.Error())
-	}
-	byt, _ := json.MarshalIndent(contributors, "  ", "  ")
-	fmt.Println(string(byt))
-
+	//con_buffer := getContributorBufer()
+	//contributors := []Contributor{}
+	//err := json.Unmarshal(con_buffer, &contributors)
+	//if err != nil {
+	//	fmt.Println(err.Error())
+	//}
+	//byt, _ := json.MarshalIndent(contributors, "  ", "  ")
+	//fmt.Println(string(byt))
 }

cmd/github/contribution_test.go

@@ -1,11 +1,7 @@
 package main
 
-import (
-	"github.com/kylesliu/awesome-golang-leetcode/cmd/leetcode"
-)
-
 func main() {
-	problems := leetcode.GetSotedproblemsInstance()
+	//problems := leetcode.GetSotedproblemsInstance()
 	//problems := leetcode.GetProblemsJosn()
 
 	//for _, v := range problems {
@@ -20,6 +16,6 @@ func main() {
 	//leetcode.GetReadmeTemplateBuffer()
 
 	//	GitBook
-	leetcode.MakeGitbookSummary(problems)
+	//leetcode.MakeGitbookSummary(problems)
 
 }

cmd/main.go

@@ -0,0 +1,90 @@
+# [376. Wiggle Subsequence][title]
+
+## Description
+
+A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with fewer than two elements is trivially a wiggle sequence.
+
+For example, [1,7,4,9,2,5] is a wiggle sequence because the differences (6,-3,5,-7,3) are alternately positive and negative. In contrast, [1,4,7,2,5] and [1,7,4,5,5] are not wiggle sequences, the first because its first two differences are positive and the second because its last difference is zero.
+
+Given a sequence of integers, return the length of the longest subsequence that is a wiggle sequence. A subsequence is obtained by deleting some number of elements (eventually, also zero) from the original sequence, leaving the remaining elements in their original order.
+
+**Example 1:**
+
+```
+Input: [1,7,4,9,2,5]
+Output: 6
+Explanation: The entire sequence is a wiggle sequence.
+```
+
+**Example 2:**
+
+```
+Input: [1,17,5,10,13,15,10,5,16,8]
+Output: 7
+Explanation: There are several subsequences that achieve this length. One is [1,17,10,13,10,16,8].
+```
+
+**Example 3:**
+
+```
+Input: [1,2,3,4,5,6,7,8,9]
+Output: 2
+```
+
+**Tags:** Math, String
+
+## 题意
+>求摇摆序列最长序列，可以转化为数组【上升】【下降】状态的转换
+
+
+## 题解
+
+### 思路1
+> 分别定义上升下降2个状态，分别做判断
+
+![376_Wiggle_Subsequence](../../assets/images/376_Wiggle_Subsequence.jpg)
+
+```go
+func wiggleMaxLength(nums []int) int {
+	//	序列个数小于二直接是摇摆序列
+	if len(nums) < 2 {
+		return len(nums)
+	}
+	//	3种状态
+	const BEGIN, UP, DOWN = 0, 1, 2
+	//	摇摆序列最小长度至少为1
+	STATE, maxLength := BEGIN, 1
+
+	for i := 1; i < len(nums); i++ {
+		switch STATE {
+		case BEGIN:
+			if nums[i-1] < nums[i] {
+				STATE = UP
+				maxLength++
+			} else if nums[i-1] > nums[i] {
+				STATE = DOWN
+				maxLength++
+			}
+		case UP:
+			if nums[i-1] > nums[i] {
+				STATE = DOWN
+				maxLength++
+			}
+		case DOWN:
+			if nums[i-1] < nums[i] {
+				STATE = UP
+				maxLength++
+			}
+		}
+	}
+	return maxLength
+}
+
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/wiggle-subsequence/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0376.Wiggle-Subsequence/README.md

@@ -0,0 +1,36 @@
+package Solution
+
+func wiggleMaxLength(nums []int) int {
+	//	序列个数小于二直接是摇摆序列
+	if len(nums) < 2 {
+		return len(nums)
+	}
+	//	3种状态
+	const BEGIN, UP, DOWN = 0, 1, 2
+	//	摇摆序列最小长度至少为1
+	STATE, maxLength := BEGIN, 1
+
+	for i := 1; i < len(nums); i++ {
+		switch STATE {
+		case BEGIN:
+			if nums[i-1] < nums[i] {
+				STATE = UP
+				maxLength++
+			} else if nums[i-1] > nums[i] {
+				STATE = DOWN
+				maxLength++
+			}
+		case UP:
+			if nums[i-1] > nums[i] {
+				STATE = DOWN
+				maxLength++
+			}
+		case DOWN:
+			if nums[i-1] < nums[i] {
+				STATE = UP
+				maxLength++
+			}
+		}
+	}
+	return maxLength
+}

src/0376.Wiggle-Subsequence/Solution.go

@@ -0,0 +1,41 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs []int
+		expect int
+	}{
+		{"TestCase", []int{1, 7, 4, 9, 2, 5}, 6},
+		{"TestCase", []int{1, 17, 5, 10, 13, 15, 10, 5, 16, 8}, 7},
+		{"TestCase", []int{1, 2, 3, 4, 5, 6, 7, 8, 9}, 2},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+strconv.Itoa(i), func(t *testing.T) {
+			got := wiggleMaxLength(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+
+}
+
+//	使用案列
+func ExampleSolution() {
+
+}