할인 행사 (연습문제)

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

프로그래머스

 

풀이

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

class Solution {
    public int solution(String[] want, int[] number, String[] discount) {
        List<Map<String, Integer>> list = new ArrayList<>();

        for (int i = 0; i < discount.length; i++) {
            Map<String, Integer> map = new HashMap<>();

            for (int j = 0; j < 10; j++) {
                if (i + j < discount.length) {
                    String key = discount[i + j];

                    if (map.containsKey(key)) {
                        map.replace(key, map.get(key) + 1);
                    } else {
                        map.put(key, 1);
                    }
                }
            }

            list.add(map);
        }

        int result = 0;

        for (Map<String, Integer> map : list) {
            int cnt = 0;

            for (int i = 0; i < want.length; i++) {
                if (map.containsKey(want[i]) && map.get(want[i]) >= number[i]) {
                    cnt++;
                }
            }

            if (cnt == want.length) {
                result++;
            }
        }

        return result;
    }
}