Merge pull request #51 from tiationg-kho/update

update

Author: tiationg-kho

README.md

@@ -171,7 +171,7 @@ Feel free to raise issues or post in discussions.
 | 149 |          | [646. Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/)                                                                                                | [E]heap                                  | greedily schedule tasks (start/end/val)                | [Python]([E]heap/[E]heap/646-maximum-length-of-pair-chain.py)                                                                                                                                         |
 | 150 |          | [2008. Maximum Earnings From Taxi](https://leetcode.com/problems/maximum-earnings-from-taxi/)                                                                                                   | [E]heap                                  | greedily schedule tasks (start/end/val)                | [Python]([E]heap/[E]heap/2008-maximum-earnings-from-taxi.py)                                                                                                                                          |
 | 151 |          | [2054. Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/)                                                                                         | [E]heap                                  | greedily schedule tasks (start/end/val)                | [Python]([E]heap/[E]heap/2054-two-best-non-overlapping-events.py)                                                                                                                                     |
-| 152 | O        | [973. K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)                                                                                                    | [E]heap                                  | top k problem (based on heap)                          | [Python]([E]heap/[E]heap/973-k-closest-points-to-origin.py)                                                                                                                                           |
+| 152 | O        | [973. K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)                                                                                                    | [E]heap                                  | top k problem (based on heap)                          | [Python]([E]heap/[E]heap/973-k-closest-points-to-origin.py) [Java]([E]heap/[E]heap/973-k-closest-points-to-origin.java)                                                                               |
 | 153 | O        | [692. Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)                                                                                                                | [E]heap                                  | top k problem (based on heap)                          | [Python]([E]heap/[E]heap/692-top-k-frequent-words.py)                                                                                                                                                 |
 | 154 |          | [264. Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)                                                                                                                            | [E]heap                                  | k way merge problem                                    | [Python]([E]heap/[E]heap/264-ugly-number-ii.py)                                                                                                                                                       |
 | 155 |          | [313. Super Ugly Number](https://leetcode.com/problems/super-ugly-number/)                                                                                                                      | [E]heap                                  | k way merge problem                                    | [Python]([E]heap/[E]heap/313-super-ugly-number.py)                                                                                                                                                    |

[E]heap/[E]heap/973-k-closest-points-to-origin.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int[][] kClosest(int[][] points, int k) {
+        PriorityQueue<int[]> heap = new PriorityQueue<>((a, b) -> Integer.compare(b[0], a[0]));
+        int[][] res = new int[k][2];
+        for (int[] p: points) {
+            heap.offer(new int[]{p[0] * p[0] + p[1] * p[1], p[0], p[1]});
+            if (heap.size() > k) {
+                heap.poll();
+            }
+        }
+        while (!heap.isEmpty()) {
+            int idx = heap.size() - 1;
+            int[] p = heap.poll();
+            res[idx][0] = p[1];
+            res[idx][1] = p[2];
+        }
+        return res;
+    }
+}
+
+// time O(nlogk)
+// space O(k)
+// using heap and top k problem (based on heap) and max heap