Leetcode 973 K Closest Points to Origin

The distance between two points on the X-Y plane is the Euclidean distance (i.e., √(x1 - x2)2 + (y1 - y2)2).

You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in).

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]].

Input: points = [[3,3],[5,-1],[-2,4]], k = 2
Output: [[3,3],[-2,4]]
Explanation: The answer [[-2,4],[3,3]] would also be accepted.

• Soruda bize bazı kordinatlar ve k sayısı veriliyor.Ve bizden origin noktasına en yakın k. kordinatı bulmamız isteniyor.
• Bu soruda heap kullanarak sıralama yapar ve sonucu bulabiliriz.

class Solution:
    def kClosest(self, points: List[List[int]], k: int) -> List[List[int]]:
        minHeap = []
        for x,y in points:
            dist = (x ** 2)+(y**2)
            minHeap.append([dist,x,y])
        
        heapq.heapify(minHeap)#minHeap listemizi heap yapısına çevirdik.
        res = []
        
        while k >0:
            dist, x, y = heapq.heappop(minHeap)#heap yapısındaki en küçük değeri getirir.:000şipğğ3jupşkldfpopğc
            
            
            
            i            k-=1
        return res