Problem 113 add solutions

halfrost · halfrost · commit ec09c8d37b7f · 2020-09-15T20:19:05.000+08:00
diff --git a/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go b/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal/103. Binary Tree Zigzag Level Order Traversal.go
@@ -16,6 +16,7 @@ type TreeNode = structures.TreeNode
  * }
  */
 
+// 解法一
 func zigzagLevelOrder(root *TreeNode) [][]int {
 	if root == nil {
 		return [][]int{}
@@ -57,3 +58,26 @@ func zigzagLevelOrder(root *TreeNode) [][]int {
 	}
 	return res
 }
+
+// 解法二 递归
+func zigzagLevelOrder0(root *TreeNode) [][]int {
+	var res [][]int
+	search(root, 0, &res)
+	return res
+}
+
+func search(root *TreeNode, depth int, res *[][]int) {
+	if root == nil {
+		return
+	}
+	for len(*res) < depth+1 {
+		*res = append(*res, []int{})
+	}
+	if depth%2 == 0 {
+		(*res)[depth] = append((*res)[depth], root.Val)
+	} else {
+		(*res)[depth] = append([]int{root.Val}, (*res)[depth]...)
+	}
+	search(root.Left, depth+1, res)
+	search(root.Right, depth+1, res)
+}
diff --git a/website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md b/website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md
@@ -56,6 +56,8 @@ package leetcode
  *     Right *TreeNode
  * }
  */
+
+// 解法一
 func zigzagLevelOrder(root *TreeNode) [][]int {
 	if root == nil {
 		return [][]int{}
@@ -98,4 +100,27 @@ func zigzagLevelOrder(root *TreeNode) [][]int {
 	return res
 }
 
+// 解法二 递归
+func zigzagLevelOrder0(root *TreeNode) [][]int {
+	var res [][]int
+	search(root, 0, &res)
+	return res
+}
+
+func search(root *TreeNode, depth int, res *[][]int) {
+	if root == nil {
+		return
+	}
+	for len(*res) < depth+1 {
+		*res = append(*res, []int{})
+	}
+	if depth%2 == 0 {
+		(*res)[depth] = append((*res)[depth], root.Val)
+	} else {
+		(*res)[depth] = append([]int{root.Val}, (*res)[depth]...)
+	}
+	search(root.Left, depth+1, res)
+	search(root.Right, depth+1, res)
+}
+
 ```
