python--leetcode654.Maximum Binary Tree

Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:

1. The root is the maximum number in the array.
2. The left subtree is the maximum tree constructed from left part subarray divided by the maximum number.
3. The right subtree is the maximum tree constructed from right part subarray divided by the maximum number.

Construct the maximum tree by the given array and output the root node of this tree.

Example 1:

Input: [3,2,1,6,0,5]
Output: return the tree root node representing the following tree:

      6
    /   \
   3     5
    \    / 
     2  0   
       \
        1

Note:

1. The size of the given array will be in the range [1,1000].

题意还是非常清楚的，就是给你一个数组，你把最大的数作为根节点，然后最大数左边的所有数作为它的左子树，最大数右边的所有数作为它的右子树。以此类推构造成最后的树。

这一题做得比较久，因为之前都是用C写树，现在用python有点不适应。

思路也很明确了，就是用递归。

代码如下：

# 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 constructMaximumBinaryTree(self, nums):
        """
        :type nums: List[int]
        :rtype: TreeNode
        """
        def construct(root,low,high):
            max=-1000
            j=0
            for i in range(low,high):
                if max<nums[i]:
                    max=nums[i]
                    j=i
            root.val=max
            if  low<j:
                root.left=TreeNode(None)
                construct(root.left,low,j)
            if  j+1<high:
                root.right=TreeNode(None)
                construct(root.right,j+1,high)
        root=TreeNode(None)
        construct(root,0,len(nums))
        return root

s=Solution()
print(s.constructMaximumBinaryTree([1,2,3]))

其实我写的比较复杂，有更好的解法调用python自己的库：

def constructMaximumBinaryTree(self, nums):   
    dummy = TreeNode(None)
    def d(root, nums):
        if not nums:
            return 
        i = nums.index(max(nums))
        root.val = max(nums)
        if nums[:i]:
            root.left = TreeNode(None)
            d(root.left, nums[:i])
        if nums[i+1:]:
            root.right = TreeNode(None)
            d(root.right, nums[i+1:])
    d(dummy, nums)
    return dummy