給定一個沒有重復的整數數組。在此數組上構建的最大樹定義如下：根是數組中的最大數。左子樹是由左部分子數組除以最大數構造的最大樹。右子樹是由右部分子數組除以最大數構造的最大樹。通過給定數組構造最大樹并輸出該樹的根節點。Input: [3,2,1,6,0,5]Output: return the tree root node representing the following tree:      6    /   \   3     5    \    /      2  0          \        1/** * Definition for a binary tree node. */function TreeNode(val) {  this.val = val;  this.left = this.right = null;}/** * @param {number[]} nums * @return {TreeNode} */var constructMaximumBinaryTree = function(nums) {  if (nums == null)    return null;  return helper(nums, 0, nums.length - 1);};function helper(nums, low, high) {  if (low > high) {    return null;  }  let maxIndex = 0;  for (let i = low; i <= high; i++) {    if (nums[maxIndex] < nums[i]) {      maxIndex = i;    }  }  let node = new TreeNode(nums[maxIndex]);  node.left = helper(nums, 0, maxIndex - 1);  node.right = helper(nums, maxIndex + 1, high);  return node;};console.log(constructMaximumBinaryTree([3,2,1,6,0,5]));