《LeetCode力扣练习》代码随想录——二叉树(最大二叉树—Java)
刷题思路来源于 代码随想录
654. 最大二叉树
-
二叉树
/** * 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 recursion(nums, 0, nums.length); } private TreeNode recursion(int[] nums, int left, int right) { if (right - left == 0) { return null; } if (right - left == 1) { return new TreeNode(nums[left]); } int index = -1; int max = Integer.MIN_VALUE; for (int i = left; i < right; i++) { if (nums[i] > max) { max = nums[i]; index = i; } } TreeNode root = new TreeNode(max); root.left = recursion(nums, left, index); root.right = recursion(nums, index + 1, right); return root; } }