mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-06 17:44:10 +08:00
添加 problem 973
This commit is contained in:
@ -0,0 +1,15 @@
|
|||||||
|
package leetcode
|
||||||
|
|
||||||
|
import "sort"
|
||||||
|
|
||||||
|
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
|
||||||
|
}
|
@ -0,0 +1,63 @@
|
|||||||
|
package leetcode
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"testing"
|
||||||
|
)
|
||||||
|
|
||||||
|
type question973 struct {
|
||||||
|
para973
|
||||||
|
ans973
|
||||||
|
}
|
||||||
|
|
||||||
|
// para 是参数
|
||||||
|
// one 代表第一个参数
|
||||||
|
type para973 struct {
|
||||||
|
one [][]int
|
||||||
|
two int
|
||||||
|
}
|
||||||
|
|
||||||
|
// ans 是答案
|
||||||
|
// one 代表第一个答案
|
||||||
|
type ans973 struct {
|
||||||
|
one [][]int
|
||||||
|
}
|
||||||
|
|
||||||
|
func Test_Problem973(t *testing.T) {
|
||||||
|
|
||||||
|
qs := []question973{
|
||||||
|
|
||||||
|
question973{
|
||||||
|
para973{[][]int{[]int{1, 3}, []int{-2, 2}}, 1},
|
||||||
|
ans973{[][]int{[]int{-2, 2}}},
|
||||||
|
},
|
||||||
|
|
||||||
|
question973{
|
||||||
|
para973{[][]int{[]int{}, []int{}}, 1},
|
||||||
|
ans973{[][]int{[]int{}}},
|
||||||
|
},
|
||||||
|
|
||||||
|
question973{
|
||||||
|
para973{[][]int{[]int{1, 3}, []int{-2, 2}}, 0},
|
||||||
|
ans973{[][]int{[]int{}}},
|
||||||
|
},
|
||||||
|
|
||||||
|
question973{
|
||||||
|
para973{[][]int{[]int{3, 3}, []int{5, -1}, []int{-2, 4}}, 2},
|
||||||
|
ans973{[][]int{[]int{3, 3}, []int{-2, 4}}},
|
||||||
|
},
|
||||||
|
|
||||||
|
question973{
|
||||||
|
para973{[][]int{[]int{0, 1}, []int{1, 0}}, 2},
|
||||||
|
ans973{[][]int{[]int{1, 0}, []int{0, 1}}},
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
fmt.Printf("------------------------Leetcode Problem 973------------------------\n")
|
||||||
|
|
||||||
|
for _, q := range qs {
|
||||||
|
_, p := q.ans973, q.para973
|
||||||
|
fmt.Printf("【input】:%v 【output】:%v\n", p, kClosest(p.one, p.two))
|
||||||
|
}
|
||||||
|
fmt.Printf("\n\n\n")
|
||||||
|
}
|
42
Algorithms/973. K Closest Points to Origin/README.md
Normal file
42
Algorithms/973. K Closest Points to Origin/README.md
Normal file
@ -0,0 +1,42 @@
|
|||||||
|
# [973. K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)
|
||||||
|
|
||||||
|
## 题目
|
||||||
|
|
||||||
|
We have a list of points on the plane. Find the K closest points to the origin (0, 0).
|
||||||
|
|
||||||
|
(Here, the distance between two points on a plane is the Euclidean distance.)
|
||||||
|
|
||||||
|
You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in.)
|
||||||
|
|
||||||
|
|
||||||
|
Example 1:
|
||||||
|
|
||||||
|
```c
|
||||||
|
Input: points = [[1,3],[-2,2]], K = 1
|
||||||
|
Output: [[-2,2]]
|
||||||
|
Explanation:
|
||||||
|
The distance between (1, 3) and the origin is sqrt(10).
|
||||||
|
The distance between (-2, 2) and the origin is sqrt(8).
|
||||||
|
Since sqrt(8) < sqrt(10), (-2, 2) is closer to the origin.
|
||||||
|
We only want the closest K = 1 points from the origin, so the answer is just [[-2,2]].
|
||||||
|
```
|
||||||
|
|
||||||
|
Example 2:
|
||||||
|
|
||||||
|
```c
|
||||||
|
Input: points = [[3,3],[5,-1],[-2,4]], K = 2
|
||||||
|
Output: [[3,3],[-2,4]]
|
||||||
|
(The answer [[-2,4],[3,3]] would also be accepted.)
|
||||||
|
```
|
||||||
|
|
||||||
|
Note:
|
||||||
|
|
||||||
|
- 1 <= K <= points.length <= 10000
|
||||||
|
- -10000 < points[i][0] < 10000
|
||||||
|
- -10000 < points[i][1] < 10000
|
||||||
|
|
||||||
|
## 题目大意
|
||||||
|
|
||||||
|
找出 K 个距离坐标原点最近的坐标点。
|
||||||
|
|
||||||
|
这题也是排序题,先将所有点距离坐标原点的距离都算出来,然后从小到大排序。取前 K 个即可。
|
Reference in New Issue
Block a user