Merge pull request youngyangyang04#2397 from eeee0717/master

Update0406.根据身高重建队列，添加C#

Author: youngyangyang04

problems/0005.最长回文子串.md

@@ -618,7 +618,7 @@ char * longestPalindrome(char * s){
 ### C#：
 
 動態規則：
-```c#
+```csharp
 public class Solution {
 
     public string LongestPalindrome(string s) {
@@ -648,7 +648,7 @@ public class Solution {
 ```
 
 雙指針：
-```C#
+```csharp
 public class Solution {
     int maxlenth = 0;
     int left = 0;

problems/0017.电话号码的字母组合.md

@@ -733,7 +733,7 @@ def backtracking(result, letter_map, digits, path, index)
 end
 ```
 ### C#
-```C#
+```csharp
 public class Solution
 {
     public IList<string> res = new List<string>();

problems/0024.两两交换链表中的节点.md

@@ -462,7 +462,7 @@ impl Solution {
 ```
 
 ### C#
-```C#
+```csharp
 // 虚拟头结点
 public ListNode SwapPairs(ListNode head)
 {

problems/0028.实现strStr.md

@@ -1359,7 +1359,7 @@ impl Solution {
 ```
 
 >前缀表统一不减一
-```C#
+```csharp
 public int StrStr(string haystack, string needle)
 {
     if (string.IsNullOrEmpty(needle))

problems/0034.在排序数组中查找元素的第一个和最后一个位置.md

@@ -331,7 +331,7 @@ class Solution {
 
 ### C#
 
-```c#
+```csharp
 public int[] SearchRange(int[] nums, int target) {
 
 	var leftBorder = GetLeftBorder(nums, target);

problems/0056.合并区间.md

@@ -336,6 +336,32 @@ impl Solution {
     }
 }
 ```
+### C#
+```csharp
+public class Solution
+{
+    public int[][] Merge(int[][] intervals)
+    {
+        if (intervals.Length == 0)
+            return intervals;
+        Array.Sort(intervals, (a, b) => a[0] - b[0]);
+        List<List<int>> res = new List<List<int>>();
+        res.Add(intervals[0].ToList());
+        for (int i = 1; i < intervals.Length; i++)
+        {
+            if (res[res.Count - 1][1] >= intervals[i][0])
+            {
+                res[res.Count - 1][1] = Math.Max(res[res.Count - 1][1], intervals[i][1]);
+            }
+            else
+            {
+                res.Add(intervals[i].ToList());
+            }
+        }
+        return res.Select(x => x.ToArray()).ToArray();
+    }
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">

problems/0062.不同路径.md

@@ -537,7 +537,7 @@ object Solution {
 
 ### c#
 
-```c#
+```csharp
 public class Solution
 {
     public int UniquePaths(int m, int n)

problems/0070.爬楼梯.md

@@ -468,7 +468,7 @@ object Solution {
 
 ### C#
 
-```c#
+```csharp
 public class Solution {
     public int ClimbStairs(int n) {
         if(n<=2) return n;

problems/0077.组合.md

@@ -793,7 +793,7 @@ end
 
 ```
 ### C#
-```C#
+```csharp
 // 暴力
 public class Solution
 {

problems/0090.子集II.md

@@ -641,7 +641,7 @@ object Solution {
 }
 ```
 ### C#
-```c#
+```csharp
 public class Solution
 {
     public IList<IList<int>> res = new List<IList<int>>();

problems/0098.验证二叉搜索树.md

@@ -792,7 +792,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public long val = Int64.MinValue;
 public bool IsValidBST(TreeNode root)

problems/0101.对称二叉树.md

@@ -898,7 +898,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public bool IsSymmetric(TreeNode root)
 {

problems/0102.二叉树的层序遍历.md

@@ -463,7 +463,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public IList<IList<int>> LevelOrder(TreeNode root)
 {
     var res = new List<IList<int>>();
@@ -825,7 +825,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public IList<IList<int>> LevelOrderBottom(TreeNode root)
 {
     var res = new List<IList<int>>();

problems/0104.二叉树的最大深度.md

@@ -1033,7 +1033,7 @@ impl Solution {
     }
 ```
 ### C#
-```C#
+```csharp
 // 递归法
 public int MaxDepth(TreeNode root) {
     if(root == null) return 0;
@@ -1044,7 +1044,7 @@ public int MaxDepth(TreeNode root) {
     return 1 + Math.Max(leftDepth, rightDepth);
 }
 ```
-```C#
+```csharp
 // 前序遍历
 int result = 0;
 public int MaxDepth(TreeNode root)
@@ -1065,7 +1065,7 @@ public void GetDepth(TreeNode root, int depth)
     return;
 }
 ```
-```C#
+```csharp
 // 迭代法
 public int MaxDepth(TreeNode root)
 {

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

@@ -1229,7 +1229,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public TreeNode BuildTree(int[] inorder, int[] postorder)
 {
     if (inorder.Length == 0 || postorder.Length == null) return null;

problems/0110.平衡二叉树.md

@@ -909,7 +909,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public bool IsBalanced(TreeNode root)
 {
     return GetHeight(root) == -1 ? false : true;

problems/0111.二叉树的最小深度.md

@@ -709,7 +709,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public int MinDepth(TreeNode root)
 {
@@ -725,7 +725,7 @@ public int MinDepth(TreeNode root)
     return res;
 }
 ```
-```C#
+```csharp
 // 迭代
 public int MinDepth(TreeNode root)
 {

problems/0112.路径总和.md

@@ -1513,7 +1513,7 @@ impl Solution {
 
 ```
 ### C#
-```C#
+```csharp
 // 0112.路径总和
 // 递归 
 public bool HasPathSum(TreeNode root, int targetSum)

problems/0151.翻转字符串里的单词.md

@@ -973,7 +973,7 @@ char * reverseWords(char * s){
 ```
 
 ### C#
-```C# LINQ高级方法
+```csharp LINQ高级方法
 public string ReverseWords(string s) {
     return string.Join(' ', s.Trim().Split(' ',StringSplitOptions.RemoveEmptyEntries).Reverse());
 }

problems/0222.完全二叉树的节点个数.md

@@ -868,7 +868,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public int CountNodes(TreeNode root)
 {

problems/0235.二叉搜索树的最近公共祖先.md

@@ -521,7 +521,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public TreeNode LowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q)
 {

problems/0236.二叉树的最近公共祖先.md

@@ -432,7 +432,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public TreeNode LowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q)
 {
     if (root == null || root == p || root == q) return root;

problems/0257.二叉树的所有路径.md

@@ -901,7 +901,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public IList<string> BinaryTreePaths(TreeNode root)
 {
     List<int> path = new();

problems/0404.左叶子之和.md

@@ -652,7 +652,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public int SumOfLeftLeaves(TreeNode root)
 {

problems/0406.根据身高重建队列.md

@@ -396,6 +396,29 @@ object Solution {
   }
 }
 ```
+### C#
+```csharp
+public class Solution
+{
+    public int[][] ReconstructQueue(int[][] people)
+    {
+        Array.Sort(people, (a, b) =>
+        {
+            if (a[0] == b[0])
+            {
+                return a[1] - b[1];
+            }
+            return b[0] - a[0];
+        });
+        var res = new List<int[]>();
+        for (int i = 0; i < people.Length; i++)
+        {
+            res.Insert(people[i][1], people[i]);
+        }
+        return res.ToArray();
+    }
+}
+```
 
 
 <p align="center">

problems/0435.无重叠区间.md

@@ -441,6 +441,27 @@ impl Solution {
     }
 }
 ```
+### C#
+```csharp
+public class Solution
+{
+    public int EraseOverlapIntervals(int[][] intervals)
+    {
+        if (intervals.Length == 0) return 0;
+        Array.Sort(intervals, (a, b) => a[1].CompareTo(b[1]));
+        int res = 1, end = intervals[0][1];
+        for (int i = 1; i < intervals.Length; i++)
+        {
+            if (end <= intervals[i][0])
+            {
+                end = intervals[i][1];
+                res++;
+            }
+        }
+        return intervals.Length - res;
+    }
+}
+```
 
 
 <p align="center">

problems/0450.删除二叉搜索树中的节点.md

@@ -772,7 +772,7 @@ impl Solution {
 ### C#
 
 > 递归法：
-```C#
+```csharp
     public TreeNode DeleteNode(TreeNode root, int key) {
         // 第一种情况：没找到删除的节点，遍历到空节点直接返回了
         if (root == null) return null;

problems/0452.用最少数量的箭引爆气球.md

@@ -332,6 +332,24 @@ object Solution {
   }
 }
 ```
+### C#
+```csharp
+public class Solution
+{
+    public int FindMinArrowShots(int[][] points)
+    {
+        if (points.Length == 0) return 0;
+        Array.Sort(points, (a, b) => a[0].CompareTo(b[0]));
+        int count = 1;
+        for (int i = 1; i < points.Length; i++)
+        {
+            if (points[i][0] > points[i - 1][1]) count++;
+            else points[i][1] = Math.Min(points[i][1], points[i - 1][1]);
+        }
+        return count;
+    }
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">

problems/0459.重复的子字符串.md

@@ -682,7 +682,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 前缀表不减一
 public bool RepeatedSubstringPattern(string s)
 {

problems/0501.二叉搜索树中的众数.md

@@ -1010,7 +1010,7 @@ pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
     }
 ```
 ### C#
-```C#
+```csharp
 // 递归 
 public class Solution
 {