c层序遍历倒输出

Author: baxiang

107binary-tree-level-order-traversal-ii/main.go

@@ -0,0 +1,48 @@
+package main
+
+import "fmt"
+
+type TreeNode struct {
+	Val   int
+	Left  *TreeNode
+	Right *TreeNode
+}
+
+func levelOrderBottom(root *TreeNode) [][]int {
+	var res [][]int
+    if root==nil{
+    	return res
+	}
+	queue := []*TreeNode{root}
+	for len(queue)>0{
+		l :=len(queue)
+		list := make([]int,0)
+		for i:=0;i<l;i++{
+			node :=queue[i]
+			list = append(list,node.Val)
+			if node.Left!=nil{
+				queue = append(queue,node.Left)
+			}
+			if node.Right!=nil{
+				queue = append(queue,node.Right)
+			}
+		}
+		res = append([][]int{list},res...)
+		queue =queue[l:]
+	}
+	return res
+}
+
+
+func main() {
+	three :=&TreeNode{Val: 3}
+	nine :=&TreeNode{Val: 9}
+	twenty :=&TreeNode{Val: 20}
+	three.Left = nine
+	three.Right = twenty
+	fifteen :=&TreeNode{Val: 15}
+	seven :=&TreeNode{Val: 7}
+	twenty.Left = fifteen
+	twenty.Right = seven
+	fmt.Println(levelOrderBottom(three))
+}

1122relative-sort-array/main.go

@@ -0,0 +1,5 @@
+package main
+
+func main() {
+	$END$
+}

11xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/main.go

@@ -0,0 +1,5 @@
+package main
+
+func main() {
+	$END$
+}

1422maximum-score-after-splitting-a-string/main.go

@@ -0,0 +1,5 @@
+package main
+
+func main() {
+	$END$
+}

154find-minimum-in-rotated-sorted-array-ii/main.go

@@ -0,0 +1,5 @@
+package main
+
+func main() {
+	$END$
+}

220contains-duplicate-iii/main.go

@@ -0,0 +1,5 @@
+package main
+
+func main() {
+	$END$
+}

297serialize-and-deserialize-binary-tree/main.go

@@ -0,0 +1,5 @@
+package main
+
+func main() {
+	$END$
+}