呓语Beta 2.0 首页 镜头后 灶台前 捐赠者名单 有趣的小站

leetcode 108 Convert Sorted Tree To BST

文档信息

leetcode 108 Convert Sorted Tree To BST

解法一

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def sortedArrayToBST(self, nums):
        """
        :type nums: List[int]
        :rtype: TreeNode
        """
        if not nums:
            return nums
        
        mid = len(nums) / 2
        root = TreeNode(nums[mid])
        left, right = (nums[:mid], nums[mid+1:])
        root.left = self.sortedArrayToBST(left) if left else None
        root.right = self.sortedArrayToBST(right) if right else None
        
        return root

note

捐赠支持

可以使用支付宝转帐给richard.ma.19850509#gmail.com(请将#替换为@),谢谢!

Fork me on GitHub