메델_project

import java.util.*; class Solution { public ArrayList solution(int[] answers) { ArrayList answer = new ArrayList(); int[] student1 = {1, 2, 3, 4, 5}; int[] student2 = {2, 1, 2, 3, 2, 4, 2, 5}; int[] student3 = {3, 3, 1, 1, 2, 2, 4, 4, 5, 5}; int[] scores = new int[3]; for(int i=0; i

import java.util.*; class Solution { public int solution(String[][] clothes) { int answer = 1; HashMap hashmap = new HashMap(); for(String[] c: clothes){ String category = c[1]; hashmap.put(category, hashmap.getOrDefault(category,0)+1); } for(int x: hashmap.values()){ answer *= (x+1); } //아무것도 입지 않는 경우 제외 return answer-1; } }

class Solution { public long solution(int n) { long[] dp = new long[n+2]; dp[0] = 0; dp[1] = 1; dp[2] = 2; for(int i=3; i

import java.util.*; class Solution { public boolean solution(String[] phone_book) { Arrays.sort(phone_book); for(int i=1; i

import java.util.*; class Solution { public int solution(int[] people, int limit) { int answer = 0; Arrays.sort(people); int start = 0; int end = people.length-1; while(start

class Solution { public int[] solution(int brown, int yellow) { int[] answer = new int[2]; int sum = brown + yellow; for(int i=1; i row){ break; } if(yB == yellow){ answer[0] = row; answer[1] = col; break; } } return answer; } }

import java.util.*; class Solution { public int solution(int k, int[] tangerine) { int answer = 0; int sum = 0; Map map = new HashMap(); for(int x: tangerine){ map.put(x, map.getOrDefault(x, 0)+1); } List list = new ArrayList(map.values()); Collections.sort(list, Collections.reverseOrder()); for(int x: list){ if(sum + x >= k){ answer++; break; }else{ sum += x; answer++; } } return answer; } }

import java.util.*; class Solution { public int solution(String t, String p) { int answer = 0; long longP = Long.parseLong(p); for(int i=0; i

class Solution { public int solution(int[] number) { int answer = 0; for(int i=0; i

import java.util.*; class Solution { public int solution(int[] ingredient) { int answer = 0; Stack stack = new Stack(); for(int x: ingredient){ stack.push(x); if(stack.size()>=4){ if(stack.get(stack.size()-4) == 1 && stack.get(stack.size()-3) == 2 && stack.get(stack.size()-2) == 3 && stack.get(stack.size()-1) == 1 ){ answer++; stack.pop(); stack.pop(); stack.pop(); stack.pop(); } } } return answ..