654. Maximum Binary Tree
2018-01-23 15:29
183 查看
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:
Note:
The size of the given array will be in the range [1,1000].
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:
The size of the given array will be in the range [1,1000].
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ class Solution { public TreeNode constructMaximumBinaryTree(int[] nums) { return construct(nums, 0, nums.length); } public TreeNode construct(int[] nums, int l, int r) { if (l == r) return null; int max_i = max(nums, l, r); TreeNode root = new TreeNode(nums[max_i]); root.left = construct(nums, l, max_i); root.right = construct(nums, max_i + 1, r); return root; } public int max(int[] nums, int l, int r) { int max_i = l; for (int i = l; i < r; i++) { if (nums[max_i] < nums[i]) max_i = i; } return max_i; } }
相关文章推荐
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree(JAVA)
- Leetcode 654. Maximum Binary Tree 最大二叉树 解题报告
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- leetcode 654. Maximum Binary Tree
- Binary Tree
- Binary Tree_ basic algorithm
- 【LeetCode】104. Maximum Depth of Binary Tree (2 solutions)
- LEETCODE —— Binary Tree的3 题 —— 3种非Recursive遍历
- Full Binary Tree 2014 SD第五届ACM大学生程序设计竞赛 F
- Binary tree 基础
- HDU 5573 Binary Tree 构造
- [leetcode]@python 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- LeetCode 111. Minimum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree
- HDU 5573 Binary Tree(规律题)
- 104. Maximum Depth of Binary Tree