mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-25 03:11:41 +08:00
17 lines
352 B
Go
17 lines
352 B
Go
package leetcode
|
|
|
|
import "sort"
|
|
|
|
// KClosest define
|
|
func KClosest(points [][]int, K int) [][]int {
|
|
sort.Slice(points, func(i, j int) bool {
|
|
return points[i][0]*points[i][0]+points[i][1]*points[i][1] <
|
|
points[j][0]*points[j][0]+points[j][1]*points[j][1]
|
|
})
|
|
ans := make([][]int, K)
|
|
for i := 0; i < K; i++ {
|
|
ans[i] = points[i]
|
|
}
|
|
return ans
|
|
}
|