Commit 320a37b

authored

feat: add cs solution to lc problem: No.1877 (doocs#1978)

1 parent b3c89d2 commit 320a37bCopy full SHA for 320a37b

File tree

+40

-0

lines changed

+40

-0

lines changed

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -136,6 +136,21 @@ function minPairSum(nums: number[]): number {`
`136`	`136`	`}`
`137`	`137`	```
`138`	`138`
	`139`	`+### C#`
	`140`	`+`
	`141`	+```cs
	`142`	`+public class Solution {`
	`143`	`+ public int MinPairSum(int[] nums) {`
	`144`	`+ Array.Sort(nums);`
	`145`	`+ int ans = 0, n = nums.Length;`
	`146`	`+ for (int i = 0; i < n >> 1; ++i) {`
	`147`	`+ ans = Math.Max(ans, nums[i] + nums[n - i - 1]);`
	`148`	`+ }`
	`149`	`+ return ans;`
	`150`	`+ }`
	`151`	`+}`
	`152`	+```
	`153`	`+`
`139`	`154`	`### ...`
`140`	`155`
`141`	`156`	```

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -122,6 +122,21 @@ function minPairSum(nums: number[]): number {`
`122`	`122`	`}`
`123`	`123`	```
`124`	`124`
	`125`	`+### C#`
	`126`	`+`
	`127`	+```cs
	`128`	`+public class Solution {`
	`129`	`+ public int MinPairSum(int[] nums) {`
	`130`	`+ Array.Sort(nums);`
	`131`	`+ int ans = 0, n = nums.Length;`
	`132`	`+ for (int i = 0; i < n >> 1; ++i) {`
	`133`	`+ ans = Math.Max(ans, nums[i] + nums[n - i - 1]);`
	`134`	`+ }`
	`135`	`+ return ans;`
	`136`	`+ }`
	`137`	`+}`
	`138`	+```
	`139`	`+`
`125`	`140`	`### ...`
`126`	`141`
`127`	`142`	```

Lines changed: 10 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,10 @@`
	`1`	`+public class Solution {`
	`2`	`+ public int MinPairSum(int[] nums) {`
	`3`	`+ Array.Sort(nums);`
	`4`	`+ int ans = 0, n = nums.Length;`
	`5`	`+ for (int i = 0; i < n >> 1; ++i) {`
	`6`	`+ ans = Math.Max(ans, nums[i] + nums[n - i - 1]);`
	`7`	`+ }`
	`8`	`+ return ans;`
	`9`	`+ }`
	`10`	`+}`

Comments

(0)