mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 17:44:10 +08:00
add: leetcode 1984 solution
This commit is contained in:
@ -0,0 +1,18 @@
|
||||
package leetcode
|
||||
|
||||
import "sort"
|
||||
|
||||
func minimumDifference(nums []int, k int) int {
|
||||
sort.Ints(nums)
|
||||
minDiff := 100000 + 1
|
||||
for i := 0; i < len(nums); i++ {
|
||||
if i+k-1 >= len(nums) {
|
||||
break
|
||||
}
|
||||
diff := nums[i+k-1] - nums[i]
|
||||
if diff < minDiff {
|
||||
minDiff = diff
|
||||
}
|
||||
}
|
||||
return minDiff
|
||||
}
|
Reference in New Issue
Block a user