[프로그래머스] 할인 행사(Java)

링크 : https://school.programmers.co.kr/learn/courses/30/lessons/131127?language=java

프로그래머스

---

문제 풀이

import java.util.*;

class Solution {
    public int solution(String[] want, int[] number, String[] discount) {
        int answer = 0;
        
        Map<String, Integer> map = new HashMap<>();
        for(int i=0; i<want.length; i++) {
            map.put(want[i], number[i]);
        }
        
        Map<String, Integer> newMap;
        
        for(int i=0; i<=discount.length-10; i++) {
            newMap = new HashMap<>();
            newMap.putAll(map);
            
            for(int j=i; j<i+10; j++) {
                String str = discount[j];
                
                if(newMap.containsKey(str)) {
                    if(newMap.get(str) > 1) {
                        newMap.put(str, newMap.get(str) - 1);    
                    } else if(newMap.get(str) - 1 == 0) {
                        newMap.remove(str);
                    }
                }
            
                if(newMap.size() == 0) {
                    answer++;
                }
            }
        }
        return answer;                
    }
}