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
34 lines (30 loc) · 871 Bytes

File metadata and controls

34 lines (30 loc) · 871 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
33
34
package problems;
import java.util.ArrayList;
import java.util.List;
public class LeetCode1382 {
List<Integer> inorderSeq = new ArrayList<>();
public TreeNode balanceBST(TreeNode root) {
getInorder(root);
return build(0, inorderSeq.size() - 1);
}
private TreeNode build(int left, int right) {
int mid = (left + right) / 2;
TreeNode root = new TreeNode(inorderSeq.get(mid));
if(left <= mid - 1) {
root.left = build(left, mid - 1);
}
if(right >= mid + 1) {
root.right = build(mid + 1, right);
}
return root;
}
private void getInorder(TreeNode root) {
if(root.left != null) {
getInorder(root.left);
}
inorderSeq.add(root.val);
if(root.right != null) {
getInorder(root.right);
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.