leetcode第一刷_Convert Sorted Array to Binary Search Tree
来源：互联网 发布：java ant作用 编辑：程序博客网 时间：2024/05/22 16:35
晕，居然还有一样的一道题，换成sorted array的话，找到中间位置更加方便了。
TreeNode *sortTree(vector<int> &num, int start, int len){ if(len <= 0) return NULL; int middle = len/2; TreeNode *root = new TreeNode(num[start+middle]); root->left = sortTree(num, start, middle); root->right = sortTree(num, start+middle+1, len-middle-1);}class Solution {public: TreeNode *sortedArrayToBST(vector<int> &num) { return sortTree(num, 0, num.size()); }}; 0 0
- leetcode第一刷_Convert Sorted Array to Binary Search Tree
- leetcode第一刷_Convert Sorted List to Binary Search Tree
- 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
- 将博客搬至CSDN
- 菜鸟面试第二站(不听劝告，坑了一脸的公司)
- 淘宝开源Key/Value结构数据存储系统Tair技术剖析
- Hive和HBase的区别
- 正则表达式
- leetcode第一刷_Convert Sorted Array to Binary Search Tree
- 对象的内存布局
- NoSQL数据库面面观
- 欢迎您在新浪博客安家
- Perl获取数组长度
- kindle3 注册地址，美国地址…
- 我的kindle导航
- kindle 3 开箱、注册、装多…
- "多看 for kindle3”升级包下载
