Leetcode sortedArrayToBST
来源:互联网 发布:resttemplate json 编辑:程序博客网 时间:2024/06/06 02:29
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution1 {
public:
TreeNode *createTree(vector<int> &num, int left, int right)
{
if (left > right)
return NULL;
int mid = (left + right) / 2;
TreeNode *leftNode = createTree(num, left, mid - 1);
TreeNode *rightNode = createTree(num, mid + 1, right);
TreeNode *node = new TreeNode(num[mid]);
node->left = leftNode;
node->right = rightNode;
return node;
}
TreeNode *sortedArrayToBST(vector<int> &num) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(num.size()==0)
return NULL;
TreeNode * root = new TreeNode(num.size()/2);
root->left = createTree(num, 0, num.size()/2-1);
root->right = createTree(num, num.size()/2-1, num.size()-1);
return root;
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution1 {
public:
TreeNode *createTree(vector<int> &num, int left, int right)
{
if (left > right)
return NULL;
int mid = (left + right) / 2;
TreeNode *leftNode = createTree(num, left, mid - 1);
TreeNode *rightNode = createTree(num, mid + 1, right);
TreeNode *node = new TreeNode(num[mid]);
node->left = leftNode;
node->right = rightNode;
return node;
}
TreeNode *sortedArrayToBST(vector<int> &num) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(num.size()==0)
return NULL;
TreeNode * root = new TreeNode(num.size()/2);
root->left = createTree(num, 0, num.size()/2-1);
root->right = createTree(num, num.size()/2-1, num.size()-1);
return root;
}
};
- Leetcode sortedArrayToBST
- Leetcode sortedArrayToBST
- LintCode SortedArrayToBST 把排序数组转换为高度最小的二叉搜索树
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- LeetCode
- UAT测试后上线出现问题的引起的思考
- POJ 1936 All in All
- Android下用代码设置静态IP地址的方法(完美支持Android2.X,Android3.X,Android4.X)
- LeetCode Flatten Binary Tree to LinkedList
- linux下重设MYSQL的ROOT密码
- Leetcode sortedArrayToBST
- 整理的oracle实现的基础sql语句查询
- Leetcode rotate list
- 设计模式之装饰模式
- android拦截短信并提取内容
- leetcode String to Integer (atoi)Dec 27 '117626 / 35090
- IGT 2014年校园招聘笔试题
- 大话设计模式二十一:单例模式(Singleton)
- Oracle高可用概述(HA与RAC的关系解惑)