Commit ff97ebf

authored

feat: add solutions to lc problem: No.1984 (doocs#605)

No.1984.Minimum Difference Between Highest and Lowest of K Scores

1 parent e3da8b2 commit ff97ebfCopy full SHA for ff97ebf

File tree

+66

-4

lines changed

solution/1900-1999/1984.Minimum Difference Between Highest and Lowest of K Scores

+66

-4

lines changed

Lines changed: 22 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -57,15 +57,35 @@`
`57`	`57`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`58`	`58`
`59`	`59`	```python
`60`		`-`
	`60`	`+class Solution:`
	`61`	`+ def minimumDifference(self, nums: List[int], k: int) -> int:`
	`62`	`+ if k == 1:`
	`63`	`+ return 0`
	`64`	`+ nums.sort()`
	`65`	`+ ans = maxsize`
	`66`	`+ for i in range(len(nums) - k + 1):`
	`67`	`+ ans = min(ans, nums[i + k - 1] - nums[i])`
	`68`	`+ return ans`
`61`	`69`	```
`62`	`70`
`63`	`71`	`### Java`
`64`	`72`
`65`	`73`	`<!-- 这里可写当前语言的特殊实现逻辑 -->`
`66`	`74`
`67`	`75`	```java
`68`		`-`
	`76`	`+class Solution {`
	`77`	`+ public int minimumDifference(int[] nums, int k) {`
	`78`	`+ if (k == 1) {`
	`79`	`+ return 0;`
	`80`	`+ }`
	`81`	`+ Arrays.sort(nums);`
	`82`	`+ int min = Integer.MAX_VALUE;`
	`83`	`+ for (int i = 0; i < nums.length - k + 1; i++) {`
	`84`	`+ min = Math.min((nums[i + k - 1] - nums[i]), min);`
	`85`	`+ }`
	`86`	`+ return min;`
	`87`	`+ }`
	`88`	`+}`
`69`	`89`	```
`70`	`90`
`71`	`91`	`### ...`

Lines changed: 22 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -51,13 +51,33 @@ The minimum possible difference is 2.</pre>`
`51`	`51`	`### Python3`
`52`	`52`
`53`	`53`	```python
`54`		`-`
	`54`	`+class Solution:`
	`55`	`+ def minimumDifference(self, nums: List[int], k: int) -> int:`
	`56`	`+ if k == 1:`
	`57`	`+ return 0`
	`58`	`+ nums.sort()`
	`59`	`+ ans = maxsize`
	`60`	`+ for i in range(len(nums) - k + 1):`
	`61`	`+ ans = min(ans, nums[i + k - 1] - nums[i])`
	`62`	`+ return ans`
`55`	`63`	```
`56`	`64`
`57`	`65`	`### Java`
`58`	`66`
`59`	`67`	```java
`60`		`-`
	`68`	`+class Solution {`
	`69`	`+ public int minimumDifference(int[] nums, int k) {`
	`70`	`+ if (k == 1) {`
	`71`	`+ return 0;`
	`72`	`+ }`
	`73`	`+ Arrays.sort(nums);`
	`74`	`+ int min = Integer.MAX_VALUE;`
	`75`	`+ for (int i = 0; i < nums.length - k + 1; i++) {`
	`76`	`+ min = Math.min((nums[i + k - 1] - nums[i]), min);`
	`77`	`+ }`
	`78`	`+ return min;`
	`79`	`+ }`
	`80`	`+}`
`61`	`81`	```
`62`	`82`
`63`	`83`	`### ...`

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,13 @@`
	`1`	`+class Solution {`
	`2`	`+ public int minimumDifference(int[] nums, int k) {`
	`3`	`+ if (k == 1) {`
	`4`	`+ return 0;`
	`5`	`+ }`
	`6`	`+ Arrays.sort(nums);`
	`7`	`+ int min = Integer.MAX_VALUE;`
	`8`	`+ for (int i = 0; i < nums.length - k + 1; i++) {`
	`9`	`+ min = Math.min((nums[i + k - 1] - nums[i]), min);`
	`10`	`+ }`
	`11`	`+ return min;`
	`12`	`+ }`
	`13`	`+}`

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,9 @@`
	`1`	`+class Solution:`
	`2`	`+ def minimumDifference(self, nums: List[int], k: int) -> int:`
	`3`	`+ if k == 1:`
	`4`	`+ return 0`
	`5`	`+ nums.sort()`
	`6`	`+ ans = maxsize`
	`7`	`+ for i in range(len(nums) - k + 1):`
	`8`	`+ ans = min(ans, nums[i + k - 1] - nums[i])`
	`9`	`+ return ans`

Comments

(0)