121 & 122 add

Author: aQua

Algorithms/0121.best-time-to-buy-and-sell-stock/README.md

@@ -0,0 +1,23 @@
+# [121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)
+
+## 题目
+Say you have an array for which the ith element is the price of a given stock on day i.
+
+If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
+```
+Example 1:
+Input: [7, 1, 5, 3, 6, 4]
+Output: 5
+```
+max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)
+
+```
+Example 2:
+Input: [7, 6, 4, 3, 1]
+Output: 0
+```
+In this case, no transaction is done, i.e. max profit = 0.
+
+## 解题思路
+
+见程序注释

Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.go

@@ -0,0 +1,5 @@
+package Problem0121
+
+func maxProfit(prices []int) int {
+
+}

Algorithms/0121.best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock_test.go

@@ -0,0 +1,48 @@
+package Problem0121
+
+import (
+	"testing"
+	"fmt"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type question struct {
+	para
+	ans
+}
+
+// para 是参数
+type para struct {
+	prices []int
+}
+
+// ans 是答案
+type ans struct {
+	one  int 
+}
+
+func Test_Problem0121(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+
+		question{
+			para{
+					,
+			},
+			ans{
+					,
+			},
+		},
+	
+		// 如需多个测试，可以复制上方元素。
+	}
+
+	for _, q := range qs {
+		a, p := q.ans, q.para
+		fmt.Printf("~~%v~~\n", p)
+
+		ast.Equal(a.one, maxProfit(p.  ), "输入:%v", p)
+	}
+}

Algorithms/0122.best-time-to-buy-and-sell-stock-ii/README.md

@@ -0,0 +1,13 @@
+# [122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)
+
+## 题目
+
+Say you have an array for which the ith element is the price of a given stock on day i.
+
+Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
+      
+
+## 解题思路
+
+
+见程序注释

Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.go

@@ -0,0 +1,5 @@
+package Problem0122
+
+func maxProfit(prices []int) int {
+
+}

Algorithms/0122.best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii_test.go

@@ -0,0 +1,48 @@
+package Problem0122
+
+import (
+	"testing"
+	"fmt"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type question struct {
+	para
+	ans
+}
+
+// para 是参数
+type para struct {
+	prices []int
+}
+
+// ans 是答案
+type ans struct {
+	one  int 
+}
+
+func Test_Problem0122(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+
+		question{
+			para{
+					,
+			},
+			ans{
+					,
+			},
+		},
+	
+		// 如需多个测试，可以复制上方元素。
+	}
+
+	for _, q := range qs {
+		a, p := q.ans, q.para
+		fmt.Printf("~~%v~~\n", p)
+
+		ast.Equal(a.one, maxProfit(p.prices  ), "输入:%v", p)
+	}
+}

helper.v3/problem.go

@@ -51,9 +51,13 @@ func (p problem) build() {
 	}
 	fc, fcHead, para, ans := getFunction(p.link())
 
+	log.Printf("开始创建 %d.%s 的文件夹...\n", p.ID, p.Title)
+
 	creatREADME(p)
 	creatGo(p, fc)
 	creatGoTest(p, fcHead, para, ans)
+
+	log.Printf("%d.%s 的文件夹，创建完毕。\n", p.ID, p.Title)
 }
 
 func creatREADME(p problem) {
@@ -68,8 +72,6 @@ func creatREADME(p problem) {
 见程序注释
 `
 
-	log.Printf("正在下载 %d.%s 的问题描述\n", p.ID, p.Title)
-
 	questionDescription := getQuestionDescription(p.link())
 
 	content := fmt.Sprintf(fileFormat, p.ID, p.Title, p.link(), questionDescription)
@@ -87,7 +89,7 @@ func getQuestionDescription(URL string) string {
 	if err != nil {
 		log.Fatal(err)
 	}
-	return doc.Find("div.question-description").Text()
+	return strings.TrimSpace(doc.Find("div.question-description").Text())
 }
 
 func getFunction(URL string) (fc, fcHead, p, a string) {