Leetcode_654 Maximum Binary Tree

一道难度为medium的题目,原题地址:https://leetcode.com/problems/maximum-binary-tree/description/,一道与树相关的题目,用递归的方法即可解决,执行时间为66ms。

题目:

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].

解决:

时间:

题目解决方法已上传到github中进行版本管理:https://github.com/fulingxuchen/leetcode

共有 0 条评论

Top