LeetCode: Find K Closest Elements Solution

Approach

From MDN Web Doc for Array.prototype.sort():

Steps:

• Sort the array by the main criteria
• Get first k elements
• Sort ascending

Implementation

1/**
2 * @param {number[]} arr
3 * @param {number} k
4 * @param {number} x
5 * @return {number[]}
6 */
7var findClosestElements = function (arr, k, x) {
8  return arr.sort(compareFunction(x)).slice(0, k).sort(compareFunctionGt)
9}
10
11const compareFunction = x => (a, b) => {
12  const [absAx, absBx] = [Math.abs(a - x), Math.abs(b - x)]
13  return absAx < absBx || (absAx === absBx && a < b) ? -1 : 0
14}
15
16const compareFunctionGt = (a, b) => a - b

References

Array.prototype.sort() (MDN Web Docs)