654. Maximum Binary Tree

本文介绍了一种构建最大二叉树的方法,通过寻找数组中的最大值作为根节点,并递归构造左右子树。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

  • 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. The left subtree is the
    maximum tree constructed from left part subarray divided by the
    maximum number.
  2. The right subtree is the maximum tree constructed from right part
    subarray divided by the maximum number.
  3. Construct the maximum tree by the given array and output the root
    node of this tree.
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

struct TreeNode* constructMaximumBinaryTree(int* nums, int numsSize) {
    int i = 0;
    int max = 0;
    struct TreeNode * root = NULL;

    if(numsSize <= 0){
        return NULL;
    }

    max = 0;

    for(i = 1;i < numsSize; ++i){
        if(nums[i]>nums[max]){
            max = i;
        }
    }

    root = (struct TreeNode *)malloc(sizeof(struct TreeNode));
    root->val = nums[max];
    root->left = constructMaximumBinaryTree(nums,max);
    root->right = constructMaximumBinaryTree(nums+max+1,numsSize - max -1);

    return root;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值