Leetcode: Convert Sorted Array to Binary Search Tree
来源:互联网 发布:suse linux 设置nfs 编辑:程序博客网 时间:2024/04/30 06:00
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode *sortedArrayToBST(vector<int> &num) { // Start typing your C/C++ solution below // DO NOT write int main() function if(num.size()==0) return NULL; return helper(num,0,num.size()-1); } TreeNode* helper(vector<int>& num,int start,int end){ if(start>end) return NULL; int middle=start+(end-start)/2; TreeNode* node=new TreeNode(num[middle]); node->left=helper(num,start,middle-1); node->right=helper(num,middle+1,end); return node; }};
- 【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 - 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
- [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
- 三步解决Linux中SSH等终端的乱码问题
- 设置nginx禁止通过IP访问服务器的方法
- leetcode 35: Remove Duplicates from Sorted Array
- log4j配置详解
- 刚开通了CSDN博客
- Leetcode: Convert Sorted Array to Binary Search Tree
- textArea, clickable logo and anchor tag for new t
- 线性同余方程解的特点及其一般求解方法
- 应该知道的Linux技巧
- leetcode 36: Remove Duplicates from Sorted Array II
- leetcode 37: Remove Duplicates from Sorted List
- 每秒100帧的行人检测方法2:
- 【APUE 学习】文件和目录 - 习题
- javascript 移除选中的option,并提示剩余个数