fix: 修复C#代码高亮问题

eeee0717 · eeee0717 · commit 709b5babf0c0 · 2024-01-04T11:12:29.000+08:00
diff --git a/problems/0005.最长回文子串.md b/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;
diff --git a/problems/0017.电话号码的字母组合.md b/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>();
diff --git a/problems/0024.两两交换链表中的节点.md b/problems/0024.两两交换链表中的节点.md
@@ -462,7 +462,7 @@ impl Solution {
 ```
 
 ### C#
-```C#
+```csharp
 // 虚拟头结点
 public ListNode SwapPairs(ListNode head)
 {
diff --git a/problems/0028.实现strStr.md b/problems/0028.实现strStr.md
@@ -1359,7 +1359,7 @@ impl Solution {
 ```
 
 >前缀表统一不减一
-```C#
+```csharp
 public int StrStr(string haystack, string needle)
 {
     if (string.IsNullOrEmpty(needle))
diff --git a/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md b/problems/0034.在排序数组中查找元素的第一个和最后一个位置.md
@@ -331,7 +331,7 @@ class Solution {
 
 ### C#
 
-```c#
+```csharp
 public int[] SearchRange(int[] nums, int target) {
 
 	var leftBorder = GetLeftBorder(nums, target);
diff --git a/problems/0062.不同路径.md b/problems/0062.不同路径.md
@@ -537,7 +537,7 @@ object Solution {
 
 ### c#
 
-```c#
+```csharp
 public class Solution
 {
     public int UniquePaths(int m, int n)
diff --git a/problems/0070.爬楼梯.md b/problems/0070.爬楼梯.md
@@ -470,7 +470,7 @@ object Solution {
 
 ### C#
 
-```c#
+```csharp
 public class Solution {
     public int ClimbStairs(int n) {
         if(n<=2) return n;
diff --git a/problems/0077.组合.md b/problems/0077.组合.md
@@ -793,7 +793,7 @@ end
 
 ```
 ### C#
-```C#
+```csharp
 // 暴力
 public class Solution
 {
diff --git a/problems/0090.子集II.md b/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>>();
diff --git a/problems/0098.验证二叉搜索树.md b/problems/0098.验证二叉搜索树.md
@@ -792,7 +792,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public long val = Int64.MinValue;
 public bool IsValidBST(TreeNode root)
diff --git a/problems/0101.对称二叉树.md b/problems/0101.对称二叉树.md
@@ -898,7 +898,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public bool IsSymmetric(TreeNode root)
 {
diff --git a/problems/0102.二叉树的层序遍历.md b/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>>();
diff --git a/problems/0104.二叉树的最大深度.md b/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)
 {
diff --git a/problems/0106.从中序与后序遍历序列构造二叉树.md b/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;
diff --git a/problems/0110.平衡二叉树.md b/problems/0110.平衡二叉树.md
@@ -909,7 +909,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public bool IsBalanced(TreeNode root)
 {
     return GetHeight(root) == -1 ? false : true;
diff --git a/problems/0111.二叉树的最小深度.md b/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)
 {
diff --git a/problems/0112.路径总和.md b/problems/0112.路径总和.md
@@ -1513,7 +1513,7 @@ impl Solution {
 
 ```
 ### C#
-```C#
+```csharp
 // 0112.路径总和
 // 递归 
 public bool HasPathSum(TreeNode root, int targetSum)
diff --git a/problems/0151.翻转字符串里的单词.md b/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());
 }
diff --git a/problems/0222.完全二叉树的节点个数.md b/problems/0222.完全二叉树的节点个数.md
@@ -868,7 +868,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public int CountNodes(TreeNode root)
 {
diff --git a/problems/0235.二叉搜索树的最近公共祖先.md b/problems/0235.二叉搜索树的最近公共祖先.md
@@ -514,7 +514,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public TreeNode LowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q)
 {
diff --git a/problems/0236.二叉树的最近公共祖先.md b/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;
diff --git a/problems/0257.二叉树的所有路径.md b/problems/0257.二叉树的所有路径.md
@@ -901,7 +901,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public IList<string> BinaryTreePaths(TreeNode root)
 {
     List<int> path = new();
diff --git a/problems/0404.左叶子之和.md b/problems/0404.左叶子之和.md
@@ -652,7 +652,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public int SumOfLeftLeaves(TreeNode root)
 {
diff --git a/problems/0450.删除二叉搜索树中的节点.md b/problems/0450.删除二叉搜索树中的节点.md
@@ -772,7 +772,7 @@ impl Solution {
 ### C#
 
 > 递归法：
-```C#
+```csharp
     public TreeNode DeleteNode(TreeNode root, int key) {
         // 第一种情况：没找到删除的节点，遍历到空节点直接返回了
         if (root == null) return null;
diff --git a/problems/0459.重复的子字符串.md b/problems/0459.重复的子字符串.md
@@ -682,7 +682,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 前缀表不减一
 public bool RepeatedSubstringPattern(string s)
 {
diff --git a/problems/0501.二叉搜索树中的众数.md b/problems/0501.二叉搜索树中的众数.md
@@ -1010,7 +1010,7 @@ pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
     }
 ```
 ### C#
-```C#
+```csharp
 // 递归 
 public class Solution
 {
diff --git a/problems/0509.斐波那契数.md b/problems/0509.斐波那契数.md
@@ -439,7 +439,7 @@ object Solution {
 
 动态规划:
 
-```c#
+```csharp
 public class Solution
 {
     public int Fib(int n)
@@ -459,7 +459,7 @@ public class Solution
 
 递归:
 
-```c#	
+```csharp	
 public class Solution
 {
     public int Fib(int n)
diff --git a/problems/0513.找树左下角的值.md b/problems/0513.找树左下角的值.md
@@ -685,7 +685,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 //递归
 int maxDepth = -1;
 int res = 0;
diff --git a/problems/0530.二叉搜索树的最小绝对差.md b/problems/0530.二叉搜索树的最小绝对差.md
@@ -648,7 +648,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public class Solution
 {
diff --git a/problems/0538.把二叉搜索树转换为累加树.md b/problems/0538.把二叉搜索树转换为累加树.md
@@ -530,7 +530,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public class Solution
 {
diff --git a/problems/0617.合并二叉树.md b/problems/0617.合并二叉树.md
@@ -789,7 +789,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public TreeNode MergeTrees(TreeNode root1, TreeNode root2)
 {
     if (root1 == null) return root2;
diff --git a/problems/0654.最大二叉树.md b/problems/0654.最大二叉树.md
@@ -583,7 +583,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 public TreeNode ConstructMaximumBinaryTree(int[] nums)
 {
     if (nums.Length == 0) return null;
diff --git a/problems/0669.修剪二叉搜索树.md b/problems/0669.修剪二叉搜索树.md
@@ -568,7 +568,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public TreeNode TrimBST(TreeNode root, int low, int high)
 {
diff --git a/problems/0700.二叉搜索树中的搜索.md b/problems/0700.二叉搜索树中的搜索.md
@@ -465,7 +465,7 @@ impl Solution {
 }
 ```
 ### C#
-```C#
+```csharp
 // 递归
 public TreeNode SearchBST(TreeNode root, int val)
 {
diff --git a/problems/0707.设计链表.md b/problems/0707.设计链表.md
@@ -1486,7 +1486,7 @@ impl MyLinkedList {
 ```
 
 ### C#
-```C#
+```csharp
 class ListNode
 {
     public int val;
diff --git a/problems/0746.使用最小花费爬楼梯.md b/problems/0746.使用最小花费爬楼梯.md
@@ -500,7 +500,7 @@ object Solution {
 
 ### C#
 
-```c#
+```csharp
 public class Solution
 {
     public int MinCostClimbingStairs(int[] cost)
diff --git a/problems/二叉树的统一迭代法.md b/problems/二叉树的统一迭代法.md
diff --git a/problems/二叉树的迭代遍历.md b/problems/二叉树的迭代遍历.md
diff --git a/problems/二叉树的递归遍历.md b/problems/二叉树的递归遍历.md
diff --git a/problems/面试题02.07.链表相交.md b/problems/面试题02.07.链表相交.md

Original file line number	Diff line number	Diff line change
`@@ -733,7 +733,7 @@ def backtracking(result, letter_map, digits, path, index)`
`733`	`733`	`end`
`734`	`734`	```
`735`	`735`	`### C#`
`736`		-```C#
	`736`	+```csharp
`737`	`737`	`public class Solution`
`738`	`738`	`{`
`739`	`739`	`public IList<string> res = new List<string>();`
Original file line number	Diff line number	Diff line change
`@@ -462,7 +462,7 @@ impl Solution {`
`462`	`462`	```
`463`	`463`
`464`	`464`	`### C#`
`465`		-```C#
	`465`	+```csharp
`466`	`466`	`// 虚拟头结点`
`467`	`467`	`public ListNode SwapPairs(ListNode head)`
`468`	`468`	`{`
Original file line number	Diff line number	Diff line change
`@@ -1359,7 +1359,7 @@ impl Solution {`
`1359`	`1359`	```
`1360`	`1360`
`1361`	`1361`	`>前缀表统一不减一`
`1362`		-```C#
	`1362`	+```csharp
`1363`	`1363`	`public int StrStr(string haystack, string needle)`
`1364`	`1364`	`{`
`1365`	`1365`	`if (string.IsNullOrEmpty(needle))`
Original file line number	Diff line number	Diff line change
`@@ -537,7 +537,7 @@ object Solution {`
`537`	`537`
`538`	`538`	`### c#`
`539`	`539`
`540`		-```c#
	`540`	+```csharp
`541`	`541`	`public class Solution`
`542`	`542`	`{`
`543`	`543`	`public int UniquePaths(int m, int n)`
Original file line number	Diff line number	Diff line change
`@@ -793,7 +793,7 @@ end`
`793`	`793`
`794`	`794`	```
`795`	`795`	`### C#`
`796`		-```C#
	`796`	+```csharp
`797`	`797`	`// 暴力`
`798`	`798`	`public class Solution`
`799`	`799`	`{`
Original file line number	Diff line number	Diff line change
`@@ -641,7 +641,7 @@ object Solution {`
`641`	`641`	`}`
`642`	`642`	```
`643`	`643`	`### C#`
`644`		-```c#
	`644`	+```csharp
`645`	`645`	`public class Solution`
`646`	`646`	`{`
`647`	`647`	`public IList<IList<int>> res = new List<IList<int>>();`
Original file line number	Diff line number	Diff line change
`@@ -792,7 +792,7 @@ impl Solution {`
`792`	`792`	`}`
`793`	`793`	```
`794`	`794`	`### C#`
`795`		-```C#
	`795`	+```csharp
`796`	`796`	`// 递归`
`797`	`797`	`public long val = Int64.MinValue;`
`798`	`798`	`public bool IsValidBST(TreeNode root)`