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

Sign up
Appearance settings

Commit 0e55c1b

Browse files
committed
Update0108.将有序数组转换为二叉搜索树,添加C#
1 parent 9615a2e commit 0e55c1b

File tree

1 file changed

+17
-0
lines changed

1 file changed

+17
-0
lines changed

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

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -530,6 +530,23 @@ impl Solution {
530530
}
531531
}
532532
```
533+
### C#
534+
```csharp
535+
// 递归
536+
public TreeNode SortedArrayToBST(int[] nums)
537+
{
538+
return Traversal(nums, 0, nums.Length - 1);
539+
}
540+
public TreeNode Traversal(int[] nums, int left, int right)
541+
{
542+
if (left > right) return null;
543+
int mid = left + (right - left) / 2;
544+
TreeNode node = new TreeNode(nums[mid]);
545+
node.left = Traversal(nums, left, mid - 1);
546+
node.right = Traversal(nums, mid + 1, right);
547+
return node;
548+
}
549+
```
533550

534551

535552
<p align="center">

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /