Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
15 lines (15 loc) · 479 Bytes

File metadata and controls

15 lines (15 loc) · 479 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
package leetcode.tree;
/*
* 有序数组构造平衡二叉树
*
* */
public class leetcode108 {
public TreeNode buildSubTree(int[] nums,int start,int end) {
if(start>end) return null;
int middle=(start+end)/2;
TreeNode root=new TreeNode(nums[middle]); //构建根节点
root.right=buildSubTree(nums,middle+1,end); //构建右子树,
root.left=buildSubTree(nums,start,middle-1); //构建左子树
return root;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.