JAVA_LeetCode 3477_Fruits Into Baskets II 풀이 class Solution { public int numOfUnplacedFruits(int[] fruits, int[] baskets) { // 인덱스별 조건에 부합되는 수를 차례대로 없애가면서 체크한다. int cnt = 0, len = fruits.length; Set set = new HashSet(); for(int i = 0; i < len; i++){ for(int j = 0; j < len; j++){ if(fruits[i] <= baskets[j] && !set.contains(j)){ set.add(j); cnt++; break; } } } return len - cnt; } } * 출처 https://leetcode.com/problems/fruits-into-baskets-ii...
