108. Convert Sorted Array to Binary Search Tree
来源:互联网 发布:python参考手册 第5版 编辑:程序博客网 时间:2024/05/17 19:57
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
改一个升序的数组变成一棵平衡查找树,
平衡查找树 左子树比右子树大,左右高度差小于1,
思路:递归建立,每次找到数组的中点作为根节点,比它小的部分作为左子树,大的部分作为右子树。判断结束条件:二分查找的start>end
public class Solution { public TreeNode sortedArrayToBST(int[] nums) { if(nums==null||nums.length==0) return null; return sort(nums,0,nums.length-1); } public TreeNode sort(int []nums,int start,int end){ if(start>end) return ; int mid=start+(end-start)/2; TreeNode root=new TreeNode(nums[mid]); root.left=sort(nums,start,mid-1); root.right=sort(nums,mid+1,end); return root ; } }
0 0
- 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
- 算法的时间复杂度
- php 类似百度搜索的分页
- 深入了解Spring
- Ubuntu问题集锦
- C语言中的static 详细分析
- 108. Convert Sorted Array to Binary Search Tree
- Entering query
- 使用Code::Blacks运行不了c++程序
- HTML5+JS游戏开发模块----canvas打字游戏升级版
- 对10个数进行排序
- Matlab2014a在Ubuntu16.04中的安装及遇到的问题
- Java知识碎片整理(1)——数组相关
- 分时系统与实时系统
- 【Search&String Algorithm Training】Xiper的奇妙历险(2)