나의 개발일지

문제 : https://school.programmers.co.kr/learn/courses/30/lessons/42578 딕셔너리, 해시 맵 파이썬 def solution(clothes): answer = 1 dic = {} for li in clothes: dic[li[1]] = dic.get(li[1], 1) + 1 for key in dic: answer *= dic[key] return answer - 1 자바 import java.util.*; class Solution { public int solution(String[][] clothes) { int answer = 1; Map map = new HashMap(); for (String[] arr : clothes) { map.put(ar..

문제 : https://school.programmers.co.kr/learn/courses/30/lessons/1845 맵, 세트 def solution(nums): return min(len(set(nums)), len(nums) / 2) 자바 import java.util.*; class Solution { public int solution(int[] nums) { int answer = 0; HashMap map = new HashMap(); for (int n : nums) { map.put(n, 0); } int a = map.keySet().size(); int b = nums.length / 2; return Math.min(a, b); } }