Format C, C++, C#, Go, Java, Python, Rust code.

codes/go/chapter_array_and_linkedlist/list_test.go

@@ -64,4 +64,4 @@ func TestList(t *testing.T) {
 	/* 排序列表 */
 	sort.Ints(list) // 排序后，列表元素从小到大排列
 	fmt.Println("排序列表后 list =", list)
-}
+}

codes/go/chapter_array_and_linkedlist/my_list_test.go

@@ -43,4 +43,4 @@ func TestMyList(t *testing.T) {
 		list.add(i)
 	}
 	fmt.Printf("扩容后的列表 list = %v ，容量 = %v ，长度 = %v\n", list.toArray(), list.capacity(), list.size())
-}
+}

codes/go/chapter_divide_and_conquer/build_tree_test.go

@@ -6,8 +6,9 @@ package chapter_divide_and_conquer
 
 import (
 	"fmt"
-	. "github.com/krahets/hello-algo/pkg"
 	"testing"
+
+	. "github.com/krahets/hello-algo/pkg"
 )
 
 func TestBuildTree(t *testing.T) {

codes/go/chapter_divide_and_conquer/hanota.go

@@ -32,7 +32,7 @@ func dfsHanota(i int, src, buf, tar *list.List) {
 }
 
 /* 求解汉诺塔 */
-func hanota(A, B, C *list.List) {
+func solveHanota(A, B, C *list.List) {
 	n := A.Len()
 	// 将 A 顶部 n 个圆盘借助 B 移到 C
 	dfsHanota(n, A, B, C)

codes/go/chapter_divide_and_conquer/hanota_test.go

@@ -7,8 +7,9 @@ package chapter_divide_and_conquer
 import (
 	"container/list"
 	"fmt"
-	. "github.com/krahets/hello-algo/pkg"
 	"testing"
+
+	. "github.com/krahets/hello-algo/pkg"
 )
 
 func TestHanota(t *testing.T) {
@@ -27,7 +28,7 @@ func TestHanota(t *testing.T) {
 	fmt.Print("C = ")
 	PrintList(C)
 
-	hanota(A, B, C)
+	solveHanota(A, B, C)
 
 	fmt.Println("圆盘移动完成后：")
 	fmt.Print("A = ")