一、题目
题目:654. 最大二叉树
难度:中等
地址:https://leetcode-cn.com/problems/maximum-binary-tree/
使用语言:Java
二、代码
/**
* 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 build(nums,0,nums.length-1);
}
public TreeNode build(int[] nums,int lo,int hi){
if(lo > hi){
return null;
}
// 找到数组中最大值和对应的索引
int index = -1;
// 不设置为这个常量 会超出内容
int maxVal = Integer.MIN_VALUE;
for(int i=lo;i<=hi;i++){
if(maxVal < nums[i]){
index = i;
maxVal = nums[i];
}
}
TreeNode root = new TreeNode(maxVal);
root.left = build(nums,lo,index-1);
root.right = build(nums,index+1,hi);
return root;
}
}