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

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

코딩테스트 연습 - [1차] 뉴스 클러스터링

 

풀이

import java.util.*;

class Solution {
    public int solution(String str1, String str2) {
        str1 = str1.toLowerCase();
        str2 = str2.toLowerCase();

        LinkedList<String> list1 = new LinkedList<>();
        LinkedList<String> list2 = new LinkedList<>();

        for (int i = 2; i <= str1.length(); i++) {
            String str = str1.substring(i - 2, i);
            if (str.matches("^[a-z][a-z]$")) {
                list1.add(str);
            }
        }

        for (int i = 2; i <= str2.length(); i++) {
            String str = str2.substring(i - 2, i);
            if (str.matches("^[a-z][a-z]$")) {
                list2.add(str);
            }
        }

        if (list1.size() > list2.size()) {
            return fn(list2, list1);
        } else {
            return fn(list1, list2);
        }
    }

    public int fn(LinkedList<String> list1, LinkedList<String> list2) {
        if (list1.size() == 0 && list2.size() == 0) {
            return 65536;
        }

        Iterator<String> iter = list1.iterator();
        LinkedList<String> compareList = new LinkedList<>(list2);
        int cnt = 0;

        while (iter.hasNext()) {
            String str = iter.next();
            if (compareList.contains(str)) {
                compareList.remove(str);
                cnt++;
            }
        }

        return (int)(65536 * cnt / (double)(list1.size() + list2.size() - cnt));
    }
}