654. Maximum Binary Tree（C语言）

654. Maximum Binary Tree（C语言）

题目

You are given an integer array nums with no duplicates. A maximum binary tree can be built recursively from nums using the following algorithm:

• Create a root node whose value is the maximum value in nums.
• Recursively build the left subtree on the subarray prefix to the left
  of the maximum value. Recursively build the right subtree on the
  subarray suffix to the right of the maximum value.
• Return the maximum binary tree built from nums.

Example 1:

Input: nums = [3,2,1,6,0,5]
Output: [6,3,5,null,2,0,null,null,1]
Explanation: The recursive calls are as follow:

• The largest value in [3,2,1,6,0,5] is 6. Left prefix is [3,2,1] and right suffix is [0,5].
  • The largest value in [3,2,1] is 3. Left prefix is [] and right suffix is [2,1].
    • Empty array, so no child.
    • The largest value in [2,1] is 2. Left prefix is [] and right suffix is [1].
      • Empty array, so no child.
      • Only one element, so child is a node with value 1.
  • The largest value in [0,5] is 5. Left prefix is [0] and right suffix is [].
    • Only one element, so child is a node with value 0.
    • Empty array, so no child.

Example 2:

Input: nums = [3,2,1]
Output: [3,null,2,null,1]

Constraints:
1 <= nums.length <= 1000
0 <= nums[i] <= 1000
All integers in nums are unique.

解答

递归+构建二叉树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
void Tra(int *nums, struct TreeNode* root, int left_border,int right_border)
{
    if(root == NULL)
    {
        return ;
    }
    int i, mid, max = -1;
    for(i = left_border; i<=right_border; i++)
    {
        if(nums[i] > max)
        {
            max = nums[i];
            mid = i;
        }
    }
    root->val = max;
    root->left = NULL;
    root->right = NULL;
    if(left_border <= mid-1)
    {
        root->left = (struct TreeNode*)malloc(sizeof(struct TreeNode));
        Tra(nums, root->left, left_border, mid-1);
    }
    if(mid+1 <= right_border)
    {
        root->right = (struct TreeNode*)malloc(sizeof(struct TreeNode));
        Tra(nums, root->right, mid+1, right_border);
    }
}
struct TreeNode* constructMaximumBinaryTree(int* nums, int numsSize){
    struct TreeNode* root = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    Tra(nums, root, 0, numsSize-1);
    return root;
}

总结

构建二叉树的注意事项：

• malloc要在递归前
• 每个节点需要初始化左右子树指向NULL
• 在malloc前考虑这个节点是否会存在，可以提前判断，也可以之后再free