day10笔记
1.题目描述
2.代码构思(debug)
class Solution:
def sortedArrayToBST(self, nums: List[int]) -> Optional[TreeNode]:
if not nums:
return
left = 0
right = len(nums)
mid = (left + right) >> 1
root = TreeNode(nums[mid])
leftnode = self.sortedArrayToBST(nums[:mid])
rightnode = self.sortedArrayToBST(nums[mid+1:])
if leftnode:
root.left = leftnode
if rightnode:
root.right = rightnode
return root