Code tidy

Author: beyondyyh

algorithms/kit/TreeNode.go

@@ -11,22 +11,22 @@ type TreeNode struct {
 var NULL = -1 << 63
 
 // BreadthFirstSearch 层级遍历
-func BreadthFirstSearch(root TreeNode) []interface{} { // {{{
-	if &root == nil {
+func BreadthFirstSearch(root *TreeNode) []interface{} { // {{{
+	if root == nil {
 		return nil
 	}
 
 	var res []interface{}
-	var nodes []TreeNode = []TreeNode{root}
+	var nodes []*TreeNode = []*TreeNode{root}
 	for len(nodes) > 0 {
 		node := nodes[0]
 		nodes = nodes[1:]
 		res = append(res, node.Val)
 		if node.Left != nil {
-			nodes = append(nodes, *node.Left)
+			nodes = append(nodes, node.Left)
 		}
 		if node.Right != nil {
-			nodes = append(nodes, *node.Right)
+			nodes = append(nodes, node.Right)
 		}
 	}
 	return res

algorithms/other/tree.BreadthFirstSearch.go

@@ -8,18 +8,18 @@ type TreeNode struct {
 }
 
 // BreadthFirstSearch 广度优先遍历
-func BreadthFirstSearch(root TreeNode) []interface{} {
+func BreadthFirstSearch(root *TreeNode) []interface{} {
 	var res []interface{}
-	var nodes []TreeNode = []TreeNode{root}
+	var nodes []*TreeNode = []*TreeNode{root}
 	for len(nodes) > 0 {
 		node := nodes[0]
 		nodes = nodes[1:]
 		res = append(res, node.Data)
 		if node.Left != nil {
-			nodes = append(nodes, *node.Left)
+			nodes = append(nodes, node.Left)
 		}
 		if node.Right != nil {
-			nodes = append(nodes, *node.Right)
+			nodes = append(nodes, node.Right)
 		}
 	}
 	return res

algorithms/tree/226.invertTree_test.go

@@ -29,7 +29,7 @@ func Test_invertTree(t *testing.T) {
 	for _, tt := range cases {
 		t.Run(tt.name, func(t *testing.T) {
 			output := invertTree(kit.Ints2Tree(tt.input))
-			out2ints := kit.BreadthFirstSearch(*output)
+			out2ints := kit.BreadthFirstSearch(output)
 			if !reflect.DeepEqual(out2ints, tt.expected) {
 				t.Errorf("invertTree(%v)=%v, expected=%v", tt.input, out2ints, tt.expected)
 			}

algorithms/tree/617.mergeTrees_test.go

@@ -31,7 +31,7 @@ func Test_mergeTrees(t *testing.T) {
 			t1 := kit.Ints2Tree(tt.input[0])
 			t2 := kit.Ints2Tree(tt.input[1])
 			output := mergeTrees(t1, t2)
-			out2ints := kit.BreadthFirstSearch(*output)
+			out2ints := kit.BreadthFirstSearch(output)
 			if !reflect.DeepEqual(out2ints, tt.expected) {
 				t.Errorf("mergeTrees(%v)=%v, expected=%v", tt.input, out2ints, tt.expected)
 			}