75 added

Author: aQua

Algorithms/0075.sort-colors/README.md

@@ -3,24 +3,17 @@
 ## 题目
 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.
-
+**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_test.go

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