Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #M-1
- class Solution:
- def kClosest(self, points: List[List[int]], k: int) -> List[List[int]]:
- ans=[]
- for i in points:
- dist=i[0]*i[0] + i[1]*i[1]
- ans.append([dist,i])
- ans.sort()
- _ans=[]
- for i in range(k):
- _ans.append(ans[i][1])
- return _ans
- #M-2
- def kClosest_sort(points, k):
- points.sort(key=lambda p: p[0]*p[0] + p[1]*p[1])
- return points[:k]
Advertisement
Add Comment
Please, Sign In to add comment