108. Convert Sorted Array to Binary Search Tree
来源:互联网 发布:oracle查询不重复数据 编辑:程序博客网 时间:2024/06/03 17:21
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
源码:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
if(nums==null||nums.length==0)return null;
TreeNode head=sortedArrayToBSTHelp(nums, 0, nums.length-1);
return head;
}
public TreeNode sortedArrayToBSTHelp(int[] nums,int start,int end)
{
if(start>end)
{
return null;
}
else
{
int medium=(start+end)/2;
TreeNode treeNode=new TreeNode(nums[medium]);
treeNode.left=sortedArrayToBSTHelp(nums, start, medium-1);
treeNode.right=sortedArrayToBSTHelp(nums, medium+1, end);
return treeNode;
}
}
}
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted Array to Binary Search Tree
- 动态执行python代码
- DES详解
- 第5章设置开发板的IP地址
- 数值分析--线性多项以及多元最小二乘拟合python3实现并画图
- java 实现两个变量的互换(不借助第三个变量,即中间变量、临时变量)
- 108. Convert Sorted Array to Binary Search Tree
- maven配置tomcat插件
- Ip地址正则表达式
- 从零开始前端学习[39]:html5中的弹性布局二(移动端响应式实现各种布局,极其重要)
- git笔记四
- Qt:TreeWidget(树控件)的简单操作
- 博客已迁移到 Eternalxc 独立站点,欢迎访问!
- <机器学习实战>--朴素贝叶斯实战(二)
- ArrayList循环遍历删除元素