Leetcode_654 Maximum Binary Tree
来源:互联网 发布:网络信息安全科普视频 编辑:程序博客网 时间:2024/06/05 07:41
一道难度为medium的题目,原题地址:https://leetcode.com/problems/maximum-binary-tree/description/,一道与树相关的题目,用递归的方法即可解决,执行时间为66ms。
题目:
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].
解决:
时间:
阅读全文
0 0
- Leetcode_654 Maximum Binary Tree
- Binary Tree Maximum Node
- Binary Tree Maximum Node
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- Leetcode654. Maximum Binary Tree
- leetcode654: Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- LeetCode Maximum Binary Tree
- 654. Maximum Binary Tree
- Maximum Binary Tree
- Maximum Binary Tree
- Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- 654. Maximum Binary Tree
- vue之模板语法
- js电梯效果
- 数组名作为函数参数
- Vue-router教程
- 自己写的几个函数
- Leetcode_654 Maximum Binary Tree
- 地址下拉列表框
- 实用类介绍2
- SAP报表开发工具 Report Painter
- CBoard框架数据集实现--DataProvider
- 移动端触碰/滚动屏幕,弹出框隐藏
- 关于对三次握手和四次挥手的体会
- basepath 跨域问题 nginx
- 友盟统计