654. Maximum Binary Tree
2018-01-22 16:53
260 查看
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:
Note:
The size of the given array will be in the range [1,1000].
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].
/** * 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* constructMaximumBinaryTree(vector<int>& nums) { return getMaxTree(nums,0,nums.size()-1); } TreeNode* getMaxTree(vector<int>& nums,int start,int end){ int max,index; max=nums[start]; index=start; if(start>end) { return NULL; } for(int i=start+1; i<=end; i++) { if(nums[i]>max) { max=nums[i]; index=i; } } TreeNode* root=new TreeNode(max); root->left=getMaxTree(nums,start,index-1); root->right=getMaxTree(nums,index+1,end); return root; } };
相关文章推荐
- 654. Maximum Binary Tree
- leetcode 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree(JAVA)
- Leetcode 654. Maximum Binary Tree 最大二叉树 解题报告
- 654. Maximum Binary Tree
- Binary tree
- poj2499 Binary Tree
- poj 2499 Binary Tree(超简单的二叉树)
- poj 2499 Binary Tree(水题)
- leetcode 104. Maximum Depth of Binary Tree
- Binary Tree 分类: POJ 2015-06-12 20:34 17人阅读 评论(0) 收藏
- 二叉线索树(Threaded binary tree)
- leetcode:104. Maximum Depth of Binary Tree
- 【LeetCode】104. Maximum Depth of Binary Tree
- HDU 5573 Binary Tree【构造】
- Binary Tree
- leetcode 104. Maximum Depth of Binary Tree
- leetcode解题报告:104. Maximum Depth of Binary Tree
- hdu 5573 Binary Tree【脑洞构造】