import java.util.*; class Solution { public int solution(int[] scoville, int K) { int answer = 0; List list = new ArrayList(); for(int i=0; i

import java.util.*; class Solution { public int solution(int[] citations) { int answer = 0; Arrays.sort(citations); for(int i=citations.length-1; i>=0; i--){ int minnum = (int)Math.min(citations[i],citations.length-i); if(answer

import java.util.*; class Solution { public int solution(int[] priorities, int location) { int answer = 0; PriorityQueue temp = new PriorityQueue(Collections.reverseOrder()); for(int i=0; i

import java.util.*; class Solution { public int solution(int n) { int answer = 0; List fib = new ArrayList(); fib.add(0); fib.add(1); for(int i=2; i n번째 피보나치 수를 구하기 위한 그 밑의 과정들도 1234567로 나누며 더해준다.

class Solution { public String[] solution(int n, int[] arr1, int[] arr2) { String[] answer = new String[n]; for(int i=0; i

class Solution { public String solution(String number, int k) { String answer = ""; int deleteCount =0; StringBuilder sb = new StringBuilder(number); for(int i=0; i