Commit a4fc5c0

authored

feat: add cs solution to lc problem: No.1887 (doocs#1984)

1 parent b10922c commit a4fc5c0Copy full SHA for a4fc5c0

File tree

+49

-0

lines changed

+49

-0

lines changed

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -201,6 +201,24 @@ func reductionOperations(nums []int) int {`
`201`	`201`	`}`
`202`	`202`	```
`203`	`203`
	`204`	`+### C#`
	`205`	`+`
	`206`	+```cs
	`207`	`+public class Solution {`
	`208`	`+ public int ReductionOperations(int[] nums) {`
	`209`	`+ Array.Sort(nums);`
	`210`	`+ int ans = 0, up = 0;`
	`211`	`+ for (int i = 1; i < nums.Length; i++) {`
	`212`	`+ if (nums[i] != nums[i - 1]) {`
	`213`	`+ up++;`
	`214`	`+ }`
	`215`	`+ ans += up;`
	`216`	`+ }`
	`217`	`+ return ans;`
	`218`	`+ }`
	`219`	`+}`
	`220`	+```
	`221`	`+`
`204`	`222`	`### ...`
`205`	`223`
`206`	`224`	```

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -183,6 +183,24 @@ func reductionOperations(nums []int) int {`
`183`	`183`	`}`
`184`	`184`	```
`185`	`185`
	`186`	`+### C#`
	`187`	`+`
	`188`	+```cs
	`189`	`+public class Solution {`
	`190`	`+ public int ReductionOperations(int[] nums) {`
	`191`	`+ Array.Sort(nums);`
	`192`	`+ int ans = 0, up = 0;`
	`193`	`+ for (int i = 1; i < nums.Length; i++) {`
	`194`	`+ if (nums[i] != nums[i - 1]) {`
	`195`	`+ up++;`
	`196`	`+ }`
	`197`	`+ ans += up;`
	`198`	`+ }`
	`199`	`+ return ans;`
	`200`	`+ }`
	`201`	`+}`
	`202`	+```
	`203`	`+`
`186`	`204`	`### ...`
`187`	`205`
`188`	`206`	```

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+public class Solution {`
	`2`	`+ public int ReductionOperations(int[] nums) {`
	`3`	`+ Array.Sort(nums);`
	`4`	`+ int ans = 0, up = 0;`
	`5`	`+ for (int i = 1; i < nums.Length; i++) {`
	`6`	`+ if (nums[i] != nums[i - 1]) {`
	`7`	`+ up++;`
	`8`	`+ }`
	`9`	`+ ans += up;`
	`10`	`+ }`
	`11`	`+ return ans;`
	`12`	`+ }`
	`13`	`+}`

Comments

(0)