BOJ1919 애너그램만들기

 

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

import java.util.Scanner;

class Main
{
    public static int[] getAlphabetCountArray(String str) {
        int[] count = new int[26];
        for (int i = 0; i < str.length(); i++)
            count[str.charAt(i) - 'a']++;
        return count;
    }

    public static void main (String[] args)
    {
        Scanner sc = new Scanner(System.in);
        String a = sc.next();
        String b = sc.next();

        int[] countA = getAlphabetCountArray(a);
        int[] countB = getAlphabetCountArray(b);

        int ans = 0;
        for (int i = 0; i < 26; i++)
            ans += Math.abs(countA[i] - countB[i]);
        System.out.println(ans);
    }
}

1919번: 애너그램 만들기

 

import java.util.*;
import java.io.*;
public class Main
{
	public static void main(String[] args) throws IOException{

	    
	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	    String word1 = br.readLine();
	    String word2 = br.readLine();
        Long ans = 0l;
        HashMap<String,Long> hashmap = new HashMap<>();
        
        for(int i=0;i<word1.length();i++){
            String w = String.valueOf(word1.charAt(i));
            if(hashmap.containsKey(w)){
                hashmap.put(w,hashmap.get(w)+1l);
            }else{
                hashmap.put(w,1l);
            } 
        }
        for(int i=0;i<word2.length();i++){
            String w = String.valueOf(word2.charAt(i));
            if(hashmap.containsKey(w) && hashmap.get(w)>0l){
                hashmap.put(w,hashmap.get(w)-1l);
            }else{
                ans++;
            } 
        }
        
        for(Long l: hashmap.values()){
            ans+=l;
        }
        
	    System.out.println(ans);
		
	}
}