class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
return dfs(nums, 0, nums.length - 1);
}
private TreeNode dfs(int[] nums, int l, int r) {
if (l > r) {
return null;
}
int m = (l + r) / 2;
TreeNode root = new TreeNode(nums[m]);
if (l == r) {
return root;
}
root.left = dfs(nums, l, m - 1);
root.right = dfs(nums, m + 1, r);
return root;
}
}
08-10
254
07-10
142
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交