목록분류 전체보기 (208)
YJ의 새벽
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/RoaUN/btsFLTM3ilu/1QjwEkQBpATZ4x4SppuTMk/img.png)
class Solution { public String solution(String my_string) { String answer = ""; String[] arr = my_string.toLowerCase().split(""); // 소문자로 바꿔 배열저장. Arrays.sort(arr); // 배열 정렬 for(int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/Pj3xW/btsFMDworzw/IKUJ3KPgaKGyPjhmkvuX21/img.png)
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; } }
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/qaBpQ/btsFMztY3rA/sJQkksuRI3cxZnPX448Yh1/img.png)
class Solution { public int[] solution(int[] numbers, String direction) { int[] answer = new int[numbers.length]; if(direction.equals("left")) { for(int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/K8x9P/btsFMPDiW1f/7kcz7XWf0hYXnKa170vNk1/img.png)
class Solution { public int[] solution(int n) { int[] answer = {}; int length = 0; int val=0; for(int i=1; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/dLL5dD/btsFMK28zAR/MrFI01iq6HfJdDx4rhva0k/img.png)
class Solution { public String solution(String my_string, int num1, int num2) { String answer = ""; // num1 -> num2 , num2 -> num1 char val1 = my_string.charAt(num1); char val2 = my_string.charAt(num2); char[] array = my_string.toCharArray(); array[num1] = val2; array[num2] = val1; answer = String.valueOf(array); return answer; } }
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/zCrdR/btsFKP5B2k1/yJmP6kBWPQN4YvLZJFNp51/img.png)
import java.util.Arrays; class Solution { public int[] solution(String my_string) { int[] answer = {}; String[] arr = my_string.replaceAll("[a-z]","").split(""); // 문자열 제거한 배열 생성 answer = new int[arr.length]; // 문자열 제거한 배열길이 생성 for(int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/brjg1s/btsFKO6HsjY/oRtxjWnQ3wp7mKTcwB9xh1/img.png)
import java.util.Arrays; class Solution { public int solution(int[] numbers) { int answer = 0; Arrays.sort(numbers); int a = numbers[numbers.length-2] * numbers[numbers.length-1]; int b = numbers[0] * numbers[1]; if ( a > b ) { answer = a; }else { answer = b; } return answer; } }