[leetcode] 654. Maximum Binary Tree
来源:互联网 发布:关系数据库教程 编辑:程序博客网 时间:2024/05/22 08:08
Question :
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].
Solution :
按照规则设计的一个递归算法,先找到数组最大值,分成两部分,递归得到左子树和右子树。
返回的条件是遇到了最左或者最右或左==右(即父节点就是最左或最右)就返回空。若左+1==右则表示只有一个元素,返回该元素的节点。
/** * 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 helper(nums, 0, nums.size()); } TreeNode* helper(vector<int>& nums, int left, int right) { if (left < 0 || right > nums.size() || left == right) return NULL; if (left + 1 == right) { TreeNode *ret = new TreeNode(nums[left]); return ret; } int index = left; for (int i = left + 1; i < right; i++) { if (nums[i] > nums[index]) { index = i; } } TreeNode *ret = new TreeNode(nums[index]); ret->left = helper(nums, left, index); ret->right = helper(nums, index+1, right); return ret; }};
阅读全文
0 0
- leetcode 654. Maximum Binary Tree
- 【LeetCode】654. Maximum Binary Tree
- [LeetCode]654. Maximum Binary Tree
- leetcode 654. Maximum Binary Tree
- leetcode 654. Maximum Binary Tree
- Leetcode: 654. Maximum Binary Tree
- LeetCode 654. Maximum Binary Tree
- [LeetCode] 654. Maximum Binary Tree
- [leetcode] 654. Maximum Binary Tree
- [LeetCode] 654. Maximum Binary Tree
- LeetCode Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- Machine Learning学习笔记-第一周
- 关于onclick动态传参
- Number of letters
- code forces E. Danil and a Part-time Job
- Java并发编程札记-目录
- [leetcode] 654. Maximum Binary Tree
- 在RHEL6.7上开启大页内存
- alter database move datafile ...... keep
- 线性表的实现及操作
- mysql重命名一个表
- RecyclerView列表九宫格瀑布流,多条目,SpringView实现上拉下拉刷新
- 递归小栗子
- 1002.A+B for Polynomials (两个多项式的解析与合并)
- foreach与&引用的学习