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
32 lines (25 loc) · 891 Bytes

File metadata and controls

32 lines (25 loc) · 891 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
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
class Problem108 {
public static void main(String[] args) {
Problem108 p = new Problem108();
int[] nums = {};
System.out.println(p.sortedArrayToBST(nums));
}
public TreeNode sortedArrayToBST(int[] nums) {
if (nums.length <= 0) return null;
int root = nums.length / 2;
TreeNode rootNode = new TreeNode(nums[root]);
rootNode.left = assign(nums, 0, root-1);
rootNode.right = assign(nums, root+1, nums.length-1);
return rootNode;
}
TreeNode assign(int[] nums, int left, int right) {
TreeNode rootNode = null;
if (right >= left) {
int root = (right+left) / 2;
rootNode = new TreeNode(nums[root]);
rootNode.left = assign(nums, left, root-1);
rootNode.right = assign(nums, root+1, right);
}
return rootNode;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.