From ed14cefdb171abdf7a6b295d912617889910c746 Mon Sep 17 00:00:00 2001 From: X-shuffle <53906918+X-shuffle@users.noreply.github.com> Date: Sat, 19 Jun 2021 15:32:30 +0800 Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200108.=E5=B0=86=E6=9C=89?= =?UTF-8?q?=E5=BA=8F=E6=95=B0=E7=BB=84=E8=BD=AC=E6=8D=A2=E4=B8=BA=E4=BA=8C?= =?UTF-8?q?=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91=20Golang=E7=89=88=E6=9C=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 添加 0108.将有序数组转换为二叉搜索树 Golang版本 --- ...将有序数组转换为二叉搜索树.md | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) diff --git a/problems/0108.将有序数组转换为二叉搜索树.md b/problems/0108.将有序数组转换为二叉搜索树.md index 2692be47..35b8bb2e 100644 --- a/problems/0108.将有序数组转换为二叉搜索树.md +++ b/problems/0108.将有序数组转换为二叉搜索树.md @@ -258,6 +258,29 @@ class Solution: Go: +> 递归(隐含回溯) + +```go +/** + * Definition for a binary tree node. + * type TreeNode struct { + * Val int + * Left *TreeNode + * Right *TreeNode + * } + */ + //递归(隐含回溯) +func sortedArrayToBST(nums []int) *TreeNode { + if len(nums)==0{return nil}//终止条件,最后数组为空则可以返回 + root:=&TreeNode{nums[len(nums)/2],nil,nil}//按照BSL的特点,从中间构造节点 + root.Left=sortedArrayToBST(nums[:len(nums)/2])//数组的左边为左子树 + root.Right=sortedArrayToBST(nums[len(nums)/2+1:])//数字的右边为右子树 + return root +} +``` + + + -----------------------