首页 > 代码库 > leetcode 654. Maximum Binary Tree
leetcode 654. Maximum Binary Tree
Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:
- 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.
- 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
Note:
- The size of the given array will be in the range [1,1000].
n^2建树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* build(int l, int r, vector<int> & nums) { int Max = INT_MIN; int tmp = -1; if (l > r) return NULL; for (int i = l; i <= r; ++i) { if (nums[i] > Max) { Max = nums[i]; tmp = i; } } TreeNode * root = new TreeNode(Max); root->left = build(l, tmp - 1, nums); root->right = build(tmp + 1, r, nums); return root; } TreeNode* constructMaximumBinaryTree(vector<int>& nums) { if (nums.size() == 0) return NULL; return build(0, nums.size()-1, nums); }};
leetcode 654. Maximum Binary Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。