Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #数组本身是有序的,那么我们知道每次只要取中点作为根,然后递归构建对应的左右子树就可以了。
- #递归的写法跟常规稍有不同,就是要把根root先new出来,然后它的左节点接到递归左边部分的返回值,右节点接到递归右边部分的返回值,最后将root返回回去。
- class Solution:
- def sortedArrayToBST(self, nums):
- """
- :type nums: List[int]
- :rtype: TreeNode
- """
- if not nums:
- return None
- mid = len(nums) // 2
- root = TreeNode(nums[mid])
- root.left = self.sortedArrayToBST(nums[0:mid])
- root.right = self.sortedArrayToBST(nums[mid+1:])
- return root
Advertisement
Add Comment
Please, Sign In to add comment