메델_project

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

import java.util.*; class Solution { public int solution(int k, int m, int[] score) { int answer = 0; Integer[] scores = new Integer[score.length]; for(int i=0; i

import java.util.*; class Solution { public int[] solution(String[] name, int[] yearning, String[][] photo) { int[] answer = new int [photo.length]; for(int i=0; i

class Solution { public String solution(int[] food) { StringBuilder sb = new StringBuilder(); for(int i=1; i

import java.util.*; class Solution { public int solution(int a, int b, int n) { int answer = 0; while(true){ if(n

import java.util.*; class Solution { public int solution(String skill, String[] skill_trees) { int answer = 0; for(int i=0; i

import java.util.*; import java.math.*; class Solution { public int[] solution(int n, int m) { BigInteger bigN = new BigInteger(Integer.toString(n)); BigInteger bigM = new BigInteger(Integer.toString(m)); BigInteger gcd = bigN.gcd(bigM); BigInteger lcm = bigN.multiply(bigM).divide(gcd); int[] answer = {gcd.intValue(), lcm.intValue()}; return answer; } } 이렇게 풀라고 낸 문제는 아닌 것 같은데 있는건 써야..

import java.util.*; class Solution { public List solution(String s) { HashMap map = new HashMap(); String[] numbers = s.replaceAll("\\{","").replaceAll("\\}", "").split(","); for(String x: numbers){ int num = Integer.parseInt(x.trim()); map.put(num, map.getOrDefault(num, 0)+1); } List keys = new ArrayList(map.keySet()); Collections.sort(keys, (v1, v2) -> (map.get(v2).compareTo(map.get(v1)))); Ar..

class Solution { static boolean[] visited; static int answer = 0; static void DFS(int depth, int k, int[][] dungeons){ for(int i=0; i=dungeons[i][0]){ visited[i] = true; DFS(depth+1, k - dungeons[i][1], dungeons); visited[i] = false; } } answer = Math.max(answer, depth); } public int solution(int k, int[][] dungeons) { visited = new boolean[dungeons.length]; DFS(0, k, dungeons); return answer; } }

import java.util.*; class Solution { public int[] solution(String s) { int[] answer = new int[2]; while(!s.equals("1")){ StringBuilder sb = new StringBuilder(); int count = 0; for(char x: s.toCharArray()){ if(x == '1'){ sb.append(x); count++; }else{ answer[1]++; } } s = Integer.toBinaryString(count); answer[0]++; } return answer; } }