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

Update 0654.最大二叉树，添加C#版

Browse Source
This commit is contained in:
eeee0717
2023-11-25 09:55:40 +08:00
parent 734616dff0
commit cbb3cf962c
1 changed files with 15 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
problems/0654.最大二叉树.md
View File

@ -582,6 +582,21 @@ impl Solution {
} }
} }
``` ```
### C#
```C#
public TreeNode ConstructMaximumBinaryTree(int[] nums)
{
if (nums.Length == 0) return null;
int rootValue = nums.Max();
TreeNode root = new TreeNode(rootValue);
int rootIndex = Array.IndexOf(nums, rootValue);
root.left = ConstructMaximumBinaryTree(nums.Take(rootIndex).ToArray());
root.right = ConstructMaximumBinaryTree(nums.Skip(rootIndex + 1).ToArray());
return root;
}
```
<p align="center"> <p align="center">
<a href="https://programmercarl.com/other/kstar.html" target="_blank"> <a href="https://programmercarl.com/other/kstar.html" target="_blank">