zoukankan      html  css  js  c++  java
  • 654. Maximum Binary Tree(easy的递归)

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

    • The root is the maximum number in the array.
    • The left subtree is the maximum tree constructed from left part subarray divided by the maximum number.
    • 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].
    class TreeNode:
        def __init__(self,x):
            self.val = x
            self.left = None
            self.right = None
    
    class Solution:
        def constructMaximumBinaryTree(self, nums):
            """
            :type nums: List[int]
            :rtype: TreeNode
            """
            if len(nums)==0:
                return None
            val = max(nums)
            pos = nums.index(val)
            root = TreeNode(val)
            val.left = self.constructMaximumBinaryTree(nums[:pos])
            val.right = self.constructMaximumBinaryTree(nums[pos+1:])
            return root
    
  • 相关阅读:
    java 实现一段文字中,出现次数最多的字
    json 字符串 <----> json 对象
    农场销售
    IDEA Tomcat配置 VM Option
    java用JSONObject生成json
    面向对象
    java读取 properties配置文件
    Jquery span标签的取值赋值
    Oracle 分析函数 over
    gitee指令集合
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/9797226.html
Copyright © 2011-2022 走看看