add: leetcode 1984 solution

This commit is contained in:
tphyhFighting
2022-02-15 12:12:50 +08:00
parent e909b40f5c
commit e95fd4b48f

View File

@ -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
}