algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 04:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0106.添加C#版

Browse Source
This commit is contained in:
eeee0717
2023-11-24 19:01:11 +08:00
parent 0d99307566
commit 734616dff0
1 changed files with 13 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
problems/0106.从中序与后序遍历序列构造二叉树.md
View File

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