1.题目描述:
给定一个不重复的整数数组nums。最大二叉树可以用下面的算法从nums递归地构建:创建一个根节点,其值为nums中的最大值。递归地在最大值左边的子数组前缀上构建左子树。递归地在最大值右边的子数组后缀上构建右子树。返回nums构建的最大二叉树。
2.递归:
本题思路与leetcode106. 从中序与后序遍历序列构造二叉树和leetcode105. 从前序与中序遍历序列构造二叉树类似,更加简单一些,代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode constructMaximumBinaryTree(int[] nums) {
return helper(nums, 0, nums.length);//left为索引,right为长度
}
public TreeNode helper(int[] nums,int left,int right) {
if (left == right) return null;
int max = -1;
int index = 0;
for (int i = left; i < right; i++) {
if (nums[i] > max) {
max = nums[i];
index = i;//找到最大值与索引位置
}
}
TreeNode root = new TreeNode(max);
root.left = helper(nums, left, index);
root.right = helper(nums, index + 1, right);
return root;
}
}