此题看题解写出
class Solution:
def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
return self.build(nums,0,len(nums)-1)
def build(self,nums,l,r):
if l>r:
return None
mid=(l+r)//2
ans=TreeNode(nums[mid])
ans.left=self.build(nums,l,mid-1)
ans.right=self.build(nums,mid+1,r)
return ans