helper 修改细节

Author: aQua

Algorithms/0075.sort-colors/README.md

@@ -0,0 +1,26 @@
+# [75. Sort Colors](https://leetcode.com/problems/sort-colors/)
+
+## 题目
+Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.
+
+
+
+Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.
+
+
+
+Note:
+You are not suppose to use the library's sort function for this problem.
+
+
+click to show follow up.
+
+
+Follow up:
+A rather straight forward solution is a two-pass algorithm using counting sort.
+First, iterate the array counting number of 0's, 1's, and 2's, then overwrite array with total number of 0's, then 1's and followed by 2's.
+Could you come up with an one-pass algorithm using only constant space?
+
+## 解题思路
+
+见程序注释

Algorithms/0075.sort-colors/sort-colors.go

@@ -0,0 +1,5 @@
+package Problem0075
+
+func sortColors(nums []int)  {
+
+}

Algorithms/0075.sort-colors/sort-colors_test.go

@@ -0,0 +1,48 @@
+package Problem0075
+
+import (
+	"testing"
+	"fmt"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type question struct {
+	para
+	ans
+}
+
+// para 是参数
+type para struct {
+	nums []int
+}
+
+// ans 是答案
+type ans struct {
+	one   
+}
+
+func Test_Problem0075(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, sortColors(p.  ), "输入:%v", p)
+	}
+}

helper.v3/main.go

@@ -26,7 +26,7 @@ func init() {
 	if _, err := toml.DecodeFile(cfgFile, &cfg); err != nil {
 		log.Fatalf(err.Error())
 	}
-	fmt.Printf("Hi, %s. \n", cfg.Login)
+	log.Printf("Hi, %s. \n", cfg.Login)
 }
 
 func main() {