사랑하애오

솔루션

const solution = (s) => {
  const count = [...s].reduce(
    (a, c) => (a[c] ? { ...a, [c]: a[c] + 1 } : { ...a, [c]: 1 }),
    {}
  );
  console.log(count);
  const answer = Object.keys(count)
    .filter((key) => count[key] === 1)
    .sort((a, b) => (a < b ? -1 : a > b ? 1 : 0))
    .join("");
  console.log(answer);

  return answer;
};

 

솔루션

const solution = (s) => {
  let answer = [];
  for (const v of s) {
    if (s.indexOf(v) === s.lastIndexOf(v)) {
      answer.push(v);
    }
  }
  answer.sort().join("");
  console.log(answer);

  return answer;
};
profile

사랑하애오

@사랑하애

포스팅이 좋았다면 "좋아요❤️" 또는 "구독👍🏻" 해주세요!