LeetCode Solutions - 771. Jewels and Stones

jewelsAndStones.js

const numJewelsInStones = (J, S) => {
  let c = 0;
  for (let i = 0; i < S.length; ++i) if (J.indexOf(S[i]) > -1) ++c;
  return c;
};

jewelsAndStones2.js

const numJewelsInStones = (J, S) => S.split``.reduce((a, c) => a + J.includes(c), 0);

jewelsAndStones3.js

const numJewelsInStones = (J, S) => {
  const JSet = new Set(J);
  return S.split``.reduce((a, c) => a + JSet.has(c), 0);
};

jewelsAndStones4.js

const numJewelsInStones = (J, S) => (S.match(new RegExp(`[${J}]`, 'g')) || []).length;

jewelsAndStones.js

Result
Runtime: 80 ms, faster than 82.72% of JavaScript online submissions for Jewels and Stones.
Memory Usage: 38.4 MB, less than 97.62% of JavaScript online submissions for Jewels and Stones.

jewelsAndStones2.js

Result
Runtime: 76 ms, faster than 93.44% of JavaScript online submissions for Jewels and Stones.
Memory Usage: 38.9 MB, less than 71.81% of JavaScript online submissions for Jewels and Stones.

jewelsAndStones3.js

Result
Runtime: 80 ms, faster than 82.72% of JavaScript online submissions for Jewels and Stones.
Memory Usage: 40.4 MB, less than 32.48% of JavaScript online submissions for Jewels and Stones.

jewelsAndStones4.js

Result
Runtime: 100 ms, faster than 9.42% of JavaScript online submissions for Jewels and Stones.
Memory Usage: 39.3 MB, less than 48.63% of JavaScript online submissions for Jewels and Stones.