LeetCode 973. K Closest Points to Origin解题报告(python)

最新推荐文章于 2020-06-15 00:57:07 发布

orientliu96

最新推荐文章于 2020-06-15 00:57:07 发布

阅读量258

点赞数

分类专栏： LeetCode 文章标签： python leetcode

本文链接：https://blog.csdn.net/Orientliu96/article/details/103470721

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

973. K Closest Points to Origin

K Closest Points to Origin python solution

题目描述

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.)
在这里插入图片描述

解析

经常做电云kNN搜索的我，看到这道题熟悉的笑了。

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