Leetcode刷题记录：构建最大数二叉树

class Solution(object):
    def constructMaximumBinaryTree(self, nums):
        """
        :type nums: List[int]
        :rtype: TreeNode
        """
        #print(max(nums))
        #print(nums.index(max(nums)))
        #print(nums)
        if len(nums) == 0:
            return None
        
        t = TreeNode(max(nums))
        if len(nums) > 1:
            t.left = self.constructMaximumBinaryTree(nums[:nums.index(max(nums))])
            t.right = self.constructMaximumBinaryTree(nums[nums.index(max(nums)) + 1 :])
        else:
            t.left = None
            t.right = None
        
        return t