YJ의 새벽

class Solution { public int[] solution(int start_num, int end_num) { int[] answer = new int[(end_num-start_num)+1]; int a = 0; for(int i=start_num; i

import java.util.Arrays; class Solution { public int solution(int[] array) { int answer = 0; // 7의 갯수를 구하라. String str = Arrays.toString(array); String[] arr = str.split(""); for(int i=0; i

class Solution { public int solution(int i, int j, int k) { int answer = 0; String iStr =""; for( ; i

import java.util.Arrays; class Solution { public int solution(String before, String after) { int answer = 0; char[] arr = before.toCharArray(); char[] arr2 = after.toCharArray(); Arrays.sort(arr); Arrays.sort(arr2); String strArr = new String(arr); String strArr2 = new String(arr2); if(strArr.equals(strArr2)) { answer = 1; }else { answer = 0; } return answer; } }

class Solution { public int solution(int order) { int answer = 0; String stringOrder = String.valueOf(order); for(int i=0; i

class Solution { public String solution(String my_string) { String answer = ""; String[] arr = my_string.toLowerCase().split(""); // 소문자로 바꿔 배열저장. Arrays.sort(arr); // 배열 정렬 for(int i=0; i

class Solution { public int solution(int num, int k) { int answer = 0; String numStr = Integer.toString(num); String kStr = Integer.toString(k); if(numStr.indexOf(kStr) == -1 ) { // 포함되지않으면 -1 을 반환 answer = -1; }else { answer = numStr.indexOf(kStr)+1; // 인덱스값 +1. } return answer; } }

class Solution { public int[] solution(int[] numbers, String direction) { int[] answer = new int[numbers.length]; if(direction.equals("left")) { for(int i=0; i