mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
Merge pull request #1158 from xiaofei-2020/tree33
添加(0108.将有序数组转换为二叉搜索树.md):增加typescript版本
This commit is contained in:
@ -251,7 +251,7 @@ class Solution {
|
||||
return root;
|
||||
}
|
||||
}
|
||||
```
|
||||
```
|
||||
|
||||
迭代: 左闭右闭 [left,right]
|
||||
```java
|
||||
@ -373,7 +373,24 @@ var sortedArrayToBST = function (nums) {
|
||||
};
|
||||
```
|
||||
|
||||
## TypeScript
|
||||
|
||||
```typescript
|
||||
function sortedArrayToBST(nums: number[]): TreeNode | null {
|
||||
function recur(nums: number[], left: number, right: number): TreeNode | null {
|
||||
if (left > right) return null;
|
||||
let mid: number = Math.floor((left + right) / 2);
|
||||
const root: TreeNode = new TreeNode(nums[mid]);
|
||||
root.left = recur(nums, left, mid - 1);
|
||||
root.right = recur(nums, mid + 1, right);
|
||||
return root;
|
||||
}
|
||||
return recur(nums, 0, nums.length - 1);
|
||||
};
|
||||
```
|
||||
|
||||
## C
|
||||
|
||||
递归
|
||||
```c
|
||||
struct TreeNode* traversal(int* nums, int left, int right) {
|
||||
|
Reference in New Issue
Block a user