import java.lang.Math;class Solution { public int solution(int[] num_list) { int answer = 0; int gop =1; int hap=0; for(int i=0;i

import java.lang.Math;class Solution { public int solution(int a, int b, int c) { int answer = 0; if(a!=b && b!=c && a!=c){ answer=a+b+c; } else if(a==b&& b==c&& a==c){ answer = (a+b+c)*(int)(Math.pow(a,2)+Math.pow(b,2)+Math.pow(c,2))*(int)(Math.pow(a,3)+Math.pow(b,3)+Math.pow(c,3)); } else{ answer = (a+b+c)*(int)(Math..

class Solution { public int solution(int a, int d, boolean[] included) { int answer = 0; for(int i=0;i

class Solution { public String solution(String code) { String answer = ""; boolean mode = false; for(int i=0;i

class Solution { public int solution(int[][] lines) { int answer = 0; int cnt[]= new int[201]; for(int[] line:lines) { int start = line[0]+100; int end = line[1] +100; for(int i=start;i1) answer++; } return answer; } }

class Solution { public int[] solution(int numer1, int denom1, int numer2, int denom2) { int numer = numer1 * denom2 + numer2 * denom1; int denom = denom1* denom2; //최대공약수 구하기 int max = 1; for(int i=1;i

class Solution { public int solution(int[] common) { int answer = 0; int a = common[0]; int b = common[1]; int c = common[2]; if(b-a == c-b) answer = common[common.length-1] + b-a; //등차 else answer = common[common.length-1]*(b/a); //등비 return answer; } }

import java.util.*; class Solution { public int solution(int[] array) { int answer = 0; Map map = new HashMap(); for(int num:array) { int cnt=0; if(map.containsKey(num)) cnt=map.get(num); map.put(num,++cnt); } Iterator it = map.keySet().iterator(); int max=-1; ..