• 문제 링크
https://www.acmicpc.net/problem/16300
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.StringTokenizer;
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringTokenizer st = new StringTokenizer(br.readLine());
        bw.write(String.valueOf(compare(count(st.nextToken(), Integer.parseInt(st.nextToken())), count(br.readLine(), 1))));
        bw.flush();
    }
    private static int compare(Map<Character, Integer> a, Map<Character, Integer> b) {
        int min = Integer.MAX_VALUE;
        for (Entry<Character, Integer> e : b.entrySet()) {
            if (a.containsKey(e.getKey())) min = Math.min(min, a.get(e.getKey()) / e.getValue());
            else return 0;
        }
        return min;
    }
    private static Map<Character, Integer> count(String s, int k) {
        Map<Character, Integer> map = new HashMap<>();
        for (int i = 0, j; i < s.length(); i = j) {
            j = i + 1;
            while (j < s.length() && Character.isDigit(s.charAt(j))) j++;
            String cnt = s.substring(i + 1, j);
            map.put(s.charAt(i), map.getOrDefault(s.charAt(i), 0) + (cnt.isEmpty() ? k : Integer.parseInt(cnt) * k));
        }
        return map;
    }
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringTokenizer st = new StringTokenizer(br.readLine());
        bw.write(String.valueOf(compare(count(st.nextToken(), Integer.parseInt(st.nextToken())), count(br.readLine(), 1))));
        bw.flush();
    }
    private static int compare(Map<Character, Integer> a, Map<Character, Integer> b) {
        int min = Integer.MAX_VALUE;
        for (Entry<Character, Integer> e : b.entrySet()) {
            if (a.containsKey(e.getKey())) min = Math.min(min, a.get(e.getKey()) / e.getValue());
            else return 0;
        }
        return min;
    }
    private static Map<Character, Integer> count(String s, int k) {
        Matcher matcher = Pattern.compile("([A-Z][a-z]*)(\\d*)").matcher(s);
        Map<Character, Integer> map = new HashMap<>();
        while (matcher.find()) {
            char c = matcher.group(1).charAt(0);
            String cnt = matcher.group(2);
            map.put(c, map.getOrDefault(c, 0) + (cnt.isEmpty() ? k : Integer.parseInt(cnt) * k));
        }
        return map;
    }
}'Problem Solving > Baekjoon' 카테고리의 다른 글
| [백준] 10813 공 바꾸기 - Implementation / Java (0) | 2024.06.04 | 
|---|---|
| [백준] 2920 음계 - Implementation / Java (0) | 2024.06.03 | 
| [백준] 5366 Total Count - Data Structure / Java (0) | 2024.06.01 | 
| [백준] 18703 Duplicate Files - Data Structure / Java (0) | 2024.05.31 | 
| [백준] 24776 Recount - Data Structure / Java (0) | 2024.05.30 | 
 
										
									 
										
									 
										
									 
										
									
댓글