LeetCode[Tree]: Convert Sorted Array to Binary Search Tree
来源：互联网 发布：mac苹果电脑备份 编辑：程序博客网 时间：2024/04/30 04:40
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
这个问题比较简单，用递归是个不错的选择，我的C++代码实现如下：
class Solution {public: TreeNode *sortedArrayToBST(vector<int> &num) { return num.empty() ? nullptr : sortedArrayToBST(num, 0, num.size() - 1); }private: TreeNode *sortedArrayToBST(vector<int> &num, int start, int end) { int mid = (start + end) >> 1; TreeNode *root = new TreeNode(num[mid]); if (start < mid) root->left = sortedArrayToBST(num, start, mid - 1); if (mid < end) root->right = sortedArrayToBST(num, mid + 1, end); return root; }};时间性能如下图所示：
0 0
- Leetcode - Tree - Convert Sorted Array to Binary Search Tree
- *(leetcode) Convert Sorted Array to Binary Search Tree (tree)
- LeetCode[Tree]: Convert Sorted Array to Binary Search Tree
- 【LeetCode】Convert Sorted Array to Binary Search Tree && Convert Sorted List to Binary Search Tree
- 【LeetCode】convert-sorted-link-to-binary-search-tree & convert-sorted-array-to-binary-search-tree
- LeetCode: Convert Sorted Array to Binary Search Tree
- [LeetCode]Convert Sorted Array to Binary Search Tree
- LeetCode Convert Sorted Array to Binary Search Tree
- [Leetcode] Convert Sorted Array to Binary Search Tree
- leetcode 11: Convert Sorted Array to Binary Search Tree
- Leetcode: Convert Sorted Array to Binary Search Tree
- [LeetCode] Convert Sorted Array to Binary Search Tree
- Leetcode 108 Convert Sorted Array to Binary Search Tree
- Leetcode 108 Convert Sorted Array to Binary Search Tree
- LeetCode Convert Sorted Array to Binary Search Tree
- [LeetCode]Convert Sorted Array to Binary Search Tree
- [Leetcode]Convert Sorted Array to Binary Search Tree
- [leetcode]Convert Sorted Array to Binary Search Tree
- 介绍 iOS7 引入的多任务处理机制之Background Fetch
- 别人的观点
- 无向网图的邻接矩阵存储结构
- TFS 使用文档 - 客户端测试（c++/c）
- 【剑指Offer面试编程题】题目1506：求1+2+3+...+n--九度OJ
- LeetCode[Tree]: Convert Sorted Array to Binary Search Tree
- 好的开源的Android的ui项目
- 友元关系与继承以及基类派生类定义构造函数时应该注意的事项
- html5编码规范
- C 数字1、2、3、4用不全相等的数字组成的三位数及其个数
- （每日算法）Leetcode --- Maximal Rectangle(最大子矩阵)
- 研究方向的思考
- Vs2013在Linux开发中的应用（22）：模块加载
- 模拟总结
