Add solution #973

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,056 LeetCode solutions in JavaScript
+# 1,057 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -781,6 +781,7 @@
 970|[Powerful Integers](./solutions/0970-powerful-integers.js)|Easy|
 971|[Flip Binary Tree To Match Preorder Traversal](./solutions/0971-flip-binary-tree-to-match-preorder-traversal.js)|Medium|
 972|[Equal Rational Numbers](./solutions/0972-equal-rational-numbers.js)|Hard|
+973|[K Closest Points to Origin](./solutions/0973-k-closest-points-to-origin.js)|Medium|
 976|[Largest Perimeter Triangle](./solutions/0976-largest-perimeter-triangle.js)|Easy|
 977|[Squares of a Sorted Array](./solutions/0977-squares-of-a-sorted-array.js)|Easy|
 985|[Sum of Even Numbers After Queries](./solutions/0985-sum-of-even-numbers-after-queries.js)|Easy|

solutions/0973-k-closest-points-to-origin.js

@@ -0,0 +1,29 @@
+/**
+ * 973. K Closest Points to Origin
+ * https://leetcode.com/problems/k-closest-points-to-origin/
+ * Difficulty: Medium
+ *
+ * Given an array of points where points[i] = [xi, yi] represents a point on the X-Y
+ * plane and an integer k, return the k closest points to the origin (0, 0).
+ *
+ * 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).
+ */
+
+/**
+ * @param {number[][]} points
+ * @param {number} k
+ * @return {number[][]}
+ */
+var kClosest = function(points, k) {
+  const getDistance = (x, y) => x * x + y * y;
+
+  return points
+    .map(point => ({ point, dist: getDistance(point[0], point[1]) }))
+    .sort((a, b) => a.dist - b.dist)
+    .slice(0, k)
+    .map(item => item.point);
+};