[프로그래머스] LV.2 [1차] 뉴스 클러스터링

[프로그래머스] LV.2 [1차] 뉴스 클러스터링

 

1. 문제 : Link

문자열이 주어졌을 때 다중집합의 교집합과 합집합을 구하는 문제

 

2. 풀이

문자열을 정제해주고 교집합 합집합을 구하면 된다.

 

3. 코드

def solution(str1, str2):
    str1 = str1.lower()
    str2 = str2.lower()
    
    one = []
    two = []
    
    for i in range(len(str1)-1):
        if str1[i].isalpha() and str1[i+1].isalpha():
            one.append(str1[i] + str1[i+1])
    for j in range(len(str2)-1):
        if str2[j].isalpha() and str2[j+1].isalpha():
            two.append(str2[j] + str2[j+1])
    

    temp = two.copy()
    h = two.copy()
    for i in one:
        if i in temp:
            temp.remove(i)
        else:
            h.append(i)
    
    temp = two.copy()
    g = []
    for i in one:
        if i in temp:
            g.append(i)
            temp.remove(i)

    if len(h) == 0:
        usa = 1
    else:
        usa = len(g) / len(h)
    return int(usa * 65536)

import java.util.*;

class Solution {
    public int solution(String str1, String str2) {
        int answer = 0;
        int hap = 0;
        int gyo = 0;
        
        List<String> arr1 = new ArrayList<String>();
        List<String> arr2 = new ArrayList<String>();
        
        for(int i=0; i<str1.length()-1; i++){
            if(Character.isLetter(str1.charAt(i)) && Character.isLetter(str1.charAt(i+1))){
                String temp = str1.substring(i,i+2).toUpperCase();
                arr1.add(temp);
            }
        }
        
        for(int i=0; i<str2.length()-1; i++){
            if(Character.isLetter(str2.charAt(i)) && Character.isLetter(str2.charAt(i+1))){
                String temp = str2.substring(i,i+2).toUpperCase();
                arr2.add(temp);
            }
        }
        if(arr1.size() == 0 && arr2.size() ==0) return 65536;
                
        hap = arr1.size() + arr2.size();
             
        for(int i=0; i<arr1.size(); i++){
            int j=0;
            while(true){
                if(arr1.get(i).equals(arr2.get(j))){
                    gyo++;
                    arr2.remove(j);
                    j--;
                    break;
                }
                j++;
                if(j == arr2.size()) break;
            }
        }
        
        hap -= gyo;
    
        float tep;
        tep = (float)gyo/hap*65536;
        answer = (int)tep;
        
        return answer;
    }
}