Skip to content

Commit 4e0ec1f

youngyangyang04 youngyangyang04

authored

Merge pull request youngyangyang04#2397 from eeee0717/master

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

2 parents c79f957 + f292cba commit 4e0ec1fCopy full SHA for 4e0ec1f

File tree

47 files changed

+213

-50

lines changed

problems

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

47 files changed

+213

-50

lines changed

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

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -618,7 +618,7 @@ char * longestPalindrome(char * s){`
`618`	`618`	`### C#:`
`619`	`619`
`620`	`620`	`動態規則:`
`621`		-```c#
	`621`	+```csharp
`622`	`622`	`public class Solution {`
`623`	`623`
`624`	`624`	`public string LongestPalindrome(string s) {`
`@@ -648,7 +648,7 @@ public class Solution {`
`648`	`648`	```
`649`	`649`
`650`	`650`	`雙指針:`
`651`		-```C#
	`651`	+```csharp
`652`	`652`	`public class Solution {`
`653`	`653`	`int maxlenth = 0;`
`654`	`654`	`int left = 0;`

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

Lines changed: 1 addition & 1 deletion

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>();`

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

Lines changed: 1 addition & 1 deletion

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`	`{`

`‎problems/0028.实现strStr.md‎`

Lines changed: 1 addition & 1 deletion

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))`

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

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -331,7 +331,7 @@ class Solution {`
`331`	`331`
`332`	`332`	`### C#`
`333`	`333`
`334`		-```c#
	`334`	+```csharp
`335`	`335`	`public int[] SearchRange(int[] nums, int target) {`
`336`	`336`
`337`	`337`	`var leftBorder = GetLeftBorder(nums, target);`

`‎problems/0056.合并区间.md‎`

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -336,6 +336,32 @@ impl Solution {`
`336`	`336`	`}`
`337`	`337`	`}`
`338`	`338`	```
	`339`	`+### C#`
	`340`	+```csharp
	`341`	`+public class Solution`
	`342`	`+{`
	`343`	`+ public int[][] Merge(int[][] intervals)`
	`344`	`+ {`
	`345`	`+ if (intervals.Length == 0)`
	`346`	`+ return intervals;`
	`347`	`+ Array.Sort(intervals, (a, b) => a[0] - b[0]);`
	`348`	`+ List<List<int>> res = new List<List<int>>();`
	`349`	`+ res.Add(intervals[0].ToList());`
	`350`	`+ for (int i = 1; i < intervals.Length; i++)`
	`351`	`+ {`
	`352`	`+ if (res[res.Count - 1][1] >= intervals[i][0])`
	`353`	`+ {`
	`354`	`+ res[res.Count - 1][1] = Math.Max(res[res.Count - 1][1], intervals[i][1]);`
	`355`	`+ }`
	`356`	`+ else`
	`357`	`+ {`
	`358`	`+ res.Add(intervals[i].ToList());`
	`359`	`+ }`
	`360`	`+ }`
	`361`	`+ return res.Select(x => x.ToArray()).ToArray();`
	`362`	`+ }`
	`363`	`+}`
	`364`	+```
`339`	`365`
`340`	`366`	`<p align="center">`
`341`	`367`	`<a href="https://programmercarl.com/other/kstar.html" target="_blank">`

`‎problems/0062.不同路径.md‎`

Lines changed: 1 addition & 1 deletion

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)`

`‎problems/0070.爬楼梯.md‎`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -468,7 +468,7 @@ object Solution {`
`468`	`468`
`469`	`469`	`### C#`
`470`	`470`
`471`		-```c#
	`471`	+```csharp
`472`	`472`	`public class Solution {`
`473`	`473`	`public int ClimbStairs(int n) {`
`474`	`474`	`if(n<=2) return n;`

`‎problems/0077.组合.md‎`

Lines changed: 1 addition & 1 deletion

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`	`{`

`‎problems/0090.子集II.md‎`

Lines changed: 1 addition & 1 deletion

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>>();`

0 commit comments

Comments

(0)