6.17 最大二叉树——【LeetCode】

package com.tree.java;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

public class seven {
	 public TreeNode constructMaximumBinaryTree(int[] nums) {
		 return constructMaximumBinaryTree1(nums, 0, nums.length);
	 }

	private TreeNode constructMaximumBinaryTree1(int[] nums, int leftIndex, int rightIndex) {
		if(rightIndex - leftIndex < 1) {
			return null;
		}
		if(rightIndex - leftIndex == 1) {//只有一个元素
			return new TreeNode(nums[leftIndex]);
		}
		int maxIndex = leftIndex;//最大值所在位置
		int maxVal = nums[maxIndex];//最大值
		for(int i = leftIndex + 1; i < rightIndex; i++) {
			if(nums[i] > maxVal) {
				maxVal = nums[i];
				maxIndex = i;
			}
		}
		TreeNode root = new TreeNode(maxVal);
		//根据maxIndex划分左右子树  ---  划分左右子树的过程其实就是在逐渐添加root的左右结点
		root.left = constructMaximumBinaryTree1(nums, leftIndex, maxIndex);
		root.right = constructMaximumBinaryTree1(nums, maxIndex + 1, rightIndex);
		return root;
	}
	 
	 
}

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;
	}
}