题973. 最接近原点的 K 个点

Python3

class Solution:
    def kClosest(self, points, K: int) :
        points.sort(key=lambda P:P[0]**2+P[1]**2)
        return points[:K]

C++

class Solution {
public:
    vector<vector<int>> kClosest(vector<vector<int>>& points, int K) {
        sort(points.begin(), points.end(), [](const vector<int>& u, const vector<int>& v) {
            return u[0] * u[0] + u[1] * u[1] < v[0] * v[0] + v[1] * v[1];
        });
        return {points.begin(), points.begin() + K};
    }
};