Commit dce769c

authored

feat: add cs solution to lc problem: No.1846 (doocs#1970)

* feat: add cs solution to lc problem: No.1846 * Update README_EN.md to lc problem: No.1930 * Update README.md to lc problem: No.1846

1 parent 7604c82 commit dce769cCopy full SHA for dce769c

File tree

+43

-0

lines changed

+43

-0

lines changed

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -159,6 +159,22 @@ function maximumElementAfterDecrementingAndRearranging(arr: number[]): number {`
`159`	`159`	`}`
`160`	`160`	```
`161`	`161`
	`162`	`+### C#`
	`163`	`+`
	`164`	+```cs
	`165`	`+public class Solution {`
	`166`	`+ public int MaximumElementAfterDecrementingAndRearranging(int[] arr) {`
	`167`	`+ Array.Sort(arr);`
	`168`	`+ int n = arr.Length;`
	`169`	`+ arr[0] = 1;`
	`170`	`+ for (int i = 1; i < n; ++i) {`
	`171`	`+ arr[i] = Math.Min(arr[i], arr[i - 1] + 1);`
	`172`	`+ }`
	`173`	`+ return arr[n - 1];`
	`174`	`+ }`
	`175`	`+}`
	`176`	+```
	`177`	`+`
`162`	`178`	`### ...`
`163`	`179`
`164`	`180`	```

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -147,6 +147,22 @@ function maximumElementAfterDecrementingAndRearranging(arr: number[]): number {`
`147`	`147`	`}`
`148`	`148`	```
`149`	`149`
	`150`	`+### C#`
	`151`	`+`
	`152`	+```cs
	`153`	`+public class Solution {`
	`154`	`+ public int MaximumElementAfterDecrementingAndRearranging(int[] arr) {`
	`155`	`+ Array.Sort(arr);`
	`156`	`+ int n = arr.Length;`
	`157`	`+ arr[0] = 1;`
	`158`	`+ for (int i = 1; i < n; ++i) {`
	`159`	`+ arr[i] = Math.Min(arr[i], arr[i - 1] + 1);`
	`160`	`+ }`
	`161`	`+ return arr[n - 1];`
	`162`	`+ }`
	`163`	`+}`
	`164`	+```
	`165`	`+`
`150`	`166`	`### ...`
`151`	`167`
`152`	`168`	```

Lines changed: 11 additions & 0 deletions

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

Comments

(0)