YJ의 새벽

class Solution { public int[] solution(int[] num_list, int n) { int[] answer = {}; int index = 0; // 배열 크기지정 if(num_list.length % n == 0) { answer = new int[num_list.length/n]; }else { answer = new int[num_list.length/n + 1]; } for(int i=0; i

class Solution { public int[] solution(int[] num_list, int n) { // 배열 길이 생성 int[] answer = new int[num_list.length]; int index = 0; // 1. n 번째 부터 값을 넣어줌. i=n for(int i=n; i

class Solution { public int[] solution(int[] num_list, int n) { // n-1 개의 배열 길이 생성 int[] answer = new int[(num_list.length)-(n-1)]; for(int i=0; i

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