LeetCode: Shortest Distance To A Character Solution

Approach

Create array of c's indexes

Ưith each char, find min of diff array from c's indexes

Implementation

1/**
2 * @param {string} s
3 * @param {character} c
4 * @return {number[]}
5 */
6var shortestToChar = function (s, c) {
7  const chars = s.split("")
8  const cIdxes = chars.reduce(
9    (acc, el, idx) => (el === c ? [...acc, idx] : acc),
10    []
11  )
12  return chars.map((_, idx) =>
13    Math.min.apply(
14      null,
15      cIdxes.map(cIdx => Math.abs(idx - cIdx))
16    )
17  )
18}