[leetcode] 第16周作业

题目：654. Maximum Binary Tree

Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:

1.The root is the maximum number in the array.
2.The left subtree is the maximum tree constructed from left part subarray divided by the maximum number.
3.The right subtree is the maximum tree constructed from right part subarray divided by the maximum number.
Construct the maximum tree by the given array and output the root node of this tree.

Example 1:

Input: [3,2,1,6,0,5]
Output: return the tree root node representing the following tree:

   6
 /   \   
3     5
\    / 
 2  0   
   \
    1

分析

题目的要求是根据给出的数组构建一颗二叉树，构建规则如下：

1.数组中的最大值为根节点

2.以根节点为准，左子树的根节点为数组左半部分的最大值

3.以根节点为准，右子树的根节点为数组右半部分的最大值

重复以上步骤，构建二叉树，最终返回二叉树的根节点。

看到题目第一个思路就是用二分查找的方法，不断地找出最大值，再不断地进行左右两边的分治，利用左边部分构造树的左节点，右边部分构造树的右节点

代码

class Solution {
public:
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        return helper(nums, 0, nums.size() - 1);
    }
    TreeNode* helper(vector<int>& nums, int left, int right){
        if(left > right) return NULL;
        int max_index = left;
        for(int i = left; i<=right; i++) {
            if(nums[i] > nums[max_index]) max_index = i; //找最大值，max_index记录最大值的下标
        }
        TreeNode* root = new TreeNode(nums[max_index]);
        root->left = helper(nums, left, max_index - 1);
        root->right = helper(nums, max_index + 1, right);
        return root;
    }
};