108.Convert Sorted Array to Binary Search Tree (将有序数组转化成二叉排序树)
来源:互联网 发布:js中select标签 编辑:程序博客网 时间:2024/05/16 12:34
public class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
return build(nums,0,nums.length-1);
}
public TreeNode build(int[]nums,int left,int right){
if(left>right) return null;
int middle = (left+right)/2;
TreeNode root = new TreeNode(nums[middle]);
root.left = build(nums,left,middle-1);
root.right = build(nums,middle+1,right);
return root;
}
}
public TreeNode sortedArrayToBST(int[] nums) {
return build(nums,0,nums.length-1);
}
public TreeNode build(int[]nums,int left,int right){
if(left>right) return null;
int middle = (left+right)/2;
TreeNode root = new TreeNode(nums[middle]);
root.left = build(nums,left,middle-1);
root.right = build(nums,middle+1,right);
return root;
}
}
0 0
- 108.Convert Sorted Array to Binary Search Tree (将有序数组转化成二叉排序树)
- Convert Sorted Array to Binary Search Tree 将有序数组转化为平衡二叉排序树(重重)
- Leetcode 108. Convert Sorted Array to Binary Search Tree 有序数组转化BST 解题报告
- Convert Sorted List to Binary Search Tree 将有序链表转化为平衡二叉排序树
- (将有序数组转成平衡二叉树)LeetCode#108. Convert Sorted Array to Binary Search Tree
- [LeetCode]Convert Sorted Array to Binary Search Tree 将有序数组转换成BST
- LeetCode-108-Convert Sorted Array to Binary Search Tree(转化已排序数组到二叉排序树)
- LeetCode OJ 之 Convert Sorted Array to Binary Search Tree(把有序数组转化为二叉搜索树)
- 108. Convert Sorted Array to Binary Search Tree 有序数组转换为平衡二叉搜索树
- 108. Convert Sorted Array to Binary Search Tree | 有序数组生成平衡二叉搜索树
- Convert Sorted Array to Binary Search Tree 把一个有序数组转换成BST @LeetCode
- Leetcode Convert Sorted Array to Binary Search Tree 有序数组转换成二叉搜索树BST
- 有序数组转换为平衡二叉搜索树(Convert Sorted Array to Binary Search Tree)
- [leetcode]Convert Sorted Array to Binary Search Tree (有序数组转化为二叉搜索树 C语言)
- [LeetCode]108. Convert Sorted Array to Binary Search Tree(升序数组转化为平衡二叉树)
- LeetCode | Convert Sorted Array to Binary Search Tree(有序数组转换成平衡二叉树搜索树)
- Convert Sorted Array to Binary Search Tree 将数组转换成二叉查找树
- 根据有序数组构造二叉查找树 Convert Sorted Array to Binary Search Tree
- Zeroc Ice 发布订阅者之demo Icestorm之clock
- 使用outline固定sql执行计划
- mysql windows 安装与使用
- 9.2链表(六)——给定一个有环链表,实现一个算法返回环路的开头结点
- hdu 1969 &&nyoj 1193 Pie【二分法】
- 108.Convert Sorted Array to Binary Search Tree (将有序数组转化成二叉排序树)
- 203Remove Linked List Elements
- HDU-1754 I Hate It
- protobuf使用
- python正则表达式函数match()和search()的区别
- java中@Override的作用
- 基于Win32API的异步串口通信
- SendMessage的返回值
- 南阳OJ~~奇偶数分离