YJ의 새벽

문자 반복 출력하기 class Solution { public String solution(String my_string, int n) { String answer = ""; for(int i=0; i

최댓값 만들기(1) class Solution { public int solution(int[] numbers) { int answer = 0; Arrays.sort(numbers); answer = numbers[numbers.length-2] * numbers[numbers.length-1]; return answer; } }

삼각형의 완성조건(1) class Solution { public int solution(int[] sides) { int answer = 0; Arrays.sort(sides); if(sides[2] >= sides[0]+sides[1] ) { answer = 2; }else { answer = 1; } return answer; } }

문자열 안에 문자열 class Solution { public int solution(String str1, String str2) { int answer = 0; if ( str1.contains(str2)) { answer = 1; }else { answer = 2; } return answer; } }

배열 자르기 class Solution { public int[] solution(int[] numbers, int num1, int num2) { int[] answer = {}; answer = Arrays.copyOfRange(numbers, num1, num2+1); return answer; } }

양꼬치 class Solution { public int solution(int n, int k) { int answer = 0; if ( n >= 10 ){ answer = ((12000*n)+( k-(n/10)) * 2000) ; }else{ answer= (12000*n) + (2000*k); } return answer; } }

배열의 평균값 class Solution { public double solution(int[] numbers) { double answer = 0; int sum = 0; for (int i=0; i

숫자 비교하기 class Solution { public int solution(int num1, int num2) { int answer = 0; if ( num1 == num2 ){ answer = 1; }else{ answer = -1; } return answer; } }