[Programmers] (2018 KAKAO BLIND RECRUITMENT) Lv 2. [1차] 뉴스 클러스터링

https://school.programmers.co.kr/learn/courses/30/lessons/17677

프로그래머스

 

function solution(str1, str2) {
    // 숫자, 공백 제거
    // 특수문자, 괄호, 공백 모두 제거 - 점은 제거 안함
    const reg1 = /[0-9 ]/gim,
        reg2 = /[`.,~!@#$%^&*()_|+\-=?;:'"<>\{\}\[\]\\\/ ]/gim;

    const str = [str1, str2];
    for (const i in str) {
        str[i] = [...str[i]].reduce((acc, el, idx, arr) => {
            if (idx >= arr.length - 1
                || (el + arr[idx + 1]).replace(reg1, "").replace(reg2, "").length !== 2)
                return acc;

            acc.push((el + arr[idx + 1]).toUpperCase());
            return acc;
        }, []);
    }

    const temp = [...str[1]];
    const intersection = str[0].filter(it => {
        if (temp.includes(it)) {
            temp.splice(temp.indexOf(it), 1);
            return true;
        }
        return false;
    }).length;

    return (intersection || str[0].length || str[1].length)
        ? Math.floor((intersection / (str[0].length + str[1].length - intersection)) * 65536) : 65536;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/17677.%E2%80%85%EF%BC%BB1%EC%B0%A8%EF%BC%BD%E2%80%85%EB%89%B4%EC%8A%A4%E2%80%85%ED%81%B4%EB%9F%AC%EC%8A%A4%ED%84%B0%EB%A7%81

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드