首页 > 代码库 > 654. Maximum Binary Tree 最大二叉树

654. Maximum Binary Tree 最大二叉树

2024-11-26 08:37:01   202人阅读

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].
根据所给数组建立二叉树，最大的作为根节点，左侧部分作为左子树，右侧部分作为右子树
  1. # Definition for a binary tree node.
  2. # class TreeNode(object):
  3. #     def __init__(self, x):
  4. #         self.val = x
  5. #         self.left = None
  6. #         self.right = None
  8. class Solution(object):
  9.     def constructMaximumBinaryTree(self, nums):
  10.         """
  11.         :type nums: List[int]
  12.         :rtype: TreeNode
  13.         """
  14.         if not nums:
  15.             return None
  17.         def helper(node, nums):
  18.             index = nums.index(max(nums))
  19.             leftArr = nums[:index]
  20.             rightArr = nums[index + 1:]
  21.             if leftArr:
  22.                 node.left = TreeNode(max(leftArr))
  23.                 helper(node.left, leftArr)
  24.             if rightArr:
  25.                 node.right = TreeNode(max(rightArr))
  26.                 helper(node.right, rightArr)
  28.         root = TreeNode(max(nums))
  29.         helper(root, nums)
  30.         return root




来自为知笔记(Wiz)


654. Maximum Binary Tree 最大二叉树


联系
我们