33 삐약 : 백준 1919[바킹독 문제 풀이|배열|JAVA]

https://www.acmicpc.net/problem/1919

1919번: 애너그램 만들기

 

package BKD_0x2_Array;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class BOJ_1919 {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));

        char[] first_str = bf.readLine().toCharArray();
        char[] second_str = bf.readLine().toCharArray();

        Arrays.sort(first_str);
        Arrays.sort(second_str);


        int count=0;
        for(int i=0;i<first_str.length;i++){
            for(int j=0;j<second_str.length;j++){
                if(first_str[i]==second_str[j]) {
                    first_str[i]=second_str[j]='A';
                    count++; break;
                }
            }
        }

        System.out.println(first_str.length+second_str.length - count*2);

    }
}