algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 02:53:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #109 from Joshua-Lu/patch-26

Browse Source 
更新 0108.将有序数组转换为二叉搜索树 Java版本
This commit is contained in:
Carl Sun
2021-05-14 10:53:36 +08:00
committed by GitHub
parent d66fe353b1 53e8993d87
commit af95c8ce09
1 changed files with 15 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
problems/0108.将有序数组转换为二叉搜索树.md
View File

@ -209,27 +209,28 @@ public:
Java：
```java
```Java
class Solution {
public TreeNode sortedArrayToBST(int[] nums) {
return sortArr(nums,0,nums.length);
return sortedArrayToBST(nums, 0, nums.length);
}
private TreeNode sortArr(int[] nums, int lo, int hi) {
if (lo == hi) return null;
int rootIdx = (lo + hi)/2;
int rootValue = nums[rootIdx];
TreeNode root = new TreeNode(rootValue);
root.left = sortArr(nums,lo,rootIdx);
root.right = sortArr(nums,rootIdx+1,hi);
public TreeNode sortedArrayToBST(int[] nums, int left, int right) {
if (left >= right) {
return null;
}
if (right - left == 1) {
return new TreeNode(nums[left]);
}
int mid = left + (right - left) / 2;
TreeNode root = new TreeNode(nums[mid]);
root.left = sortedArrayToBST(nums, left, mid);
root.right = sortedArrayToBST(nums, mid + 1, right);
return root;
}
}
```
```
Python：