class Solution { public String solution(String rny_string) { String answer = ""; for(int i = 0; i < rny_string.length(); i++){ if(rny_string.charAt(i) == 'm'){ answer += "rn"; }else{ answer += rny_string.charAt(i); } } System.out.println(answer); return answer; } }
class Solution { public int[] solution(int[] num_list, int n) { int[] answer = new int[n]; for(int i = 0; i < n; i++){ answer[i] = num_list[i]; } return answer; } }
class Solution { public String solution(String my_string, int[] index_list) { String answer = ""; String[] str = new String[my_string.length()]; for(int i = 0; i< str.length; i++){ str[i] = String.valueOf(my_string.charAt(i)); } for(int i = 0; i < index_list.length; i++){ answer += str[index_list[i]]; } System.out.println(answer); return answer; } }
class Solution { public int solution(int[] num_list, int n) { int answer = 0; for(int i = 0; i < num_list.length; i++){ if(num_list[i] == n){ answer = 1; } } return answer; } }
class Solution { public int solution(int a, int b) { int answer = 0; if(a % 2 == 1 && b % 2 == 1){ answer = a*a + b*b; }else if( (a % 2 == 1 && b % 2 == 0) || (a % 2 == 0 && b % 2 == 1)){ answer = 2*(a+b); }else{ answer = Math.abs(a - b); } return answer; } }
import java.util.*; class Solution { public String[] solution(String my_string) { my_string = my_string.trim(); String[] answer = my_string.split("\\s+"); System.out.println(Arrays.toString(answer)); return answer; } }
class Solution { public String solution(String myString) { String answer = ""; answer = myString.toUpperCase(); return answer; } }
class Solution { public int solution(double flo) { int answer = 0; answer = (int) flo; return answer; } }
스택으로도 구현이 가능하지만 LinkedList를 공부할겸 써 봤다 아직은 어려운걸보니 초보인게 맞다 import java.util.*; class Solution { public int[] solution(int[] arr) { LinkedList stk = new LinkedList(); for(int i = 0; i i).toArray(); } }
import java.util.*; class Solution { public static List solution(int n) { List answer = new ArrayList(); answer.add(n); while(n != 1){ if(n % 2 == 0){ n = n/2; }else{ n = 3*n + 1; } answer.add(n); } System.out.println(answer); return answer; } }
