목록JavaAlgorithm (47)
KSI일기장
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/cYzlhn/btsBxXNcVJF/mQgUKOq441YOYJZjDg4p31/img.png)
class Solution { public String solution(int age) { String answer = ""; int ageDv1 = age/10; int ageDv2 = age%10; if(ageDv1
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bBvCJD/btsBtJVQaWx/IpOghhJ2veQMKVgldydUg1/img.png)
class Solution { public int[] solution(int[] numbers, String direction) { int[] answer = new int[numbers.length]; if(direction.equals("right")){ for (int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/LbAhz/btsBrdJydDz/GJJ80QzzlWw6x5FJrvkA21/img.png)
import java.util.Arrays; class Solution { public int[] solution(String my_string) { my_string = my_string.replaceAll("[a-z,A-Z]", ""); char[] ch = my_string.toCharArray(); Arrays.sort(ch); int[] answer = new int[ch.length]; for(int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bYViye/btsBkj4FbGo/JRHTlz3TECToOyuGLnmyA0/img.png)
class Solution { public String solution(String my_string, int num1, int num2) { //my_string을 배열로 변환 char[] trans = my_string.toCharArray(); //인덱스값 순서를 바꿔 넣을 my_string과 같은 길이의 배열 선언 char[] answer = new char[trans.length]; //my_string 배열로 바꾼 trans의 값들을 새로 선언한 answer배열에 넣어준다 for (int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/b19MAb/btsBqdPNywr/6oM4iCIiMi2bnyBqeIJLgk/img.png)
class Solution { public int[] solution(int[] array) { int mv = Integer.MIN_VALUE; int mvIn = -1; //최대값mv가 int중 가장 작은 값으로 설정되있다. for(int i=0; imv) { mv = Math.max(mv, array[i]); mvIn = i; } } int[] answer = {mv, mvIn}; return answer; } } class Solution { public int[] solution(int[] array) { int[] answer = new int[2]; for(int i=0;i answer[0]) { answer[0] = array[i]; answer[1] = i; } } return answe..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/b0PScF/btsBiV2umms/bdhz0ZF8hqoMmsVCdUx9ik/img.png)
import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); String star = "*"; for(int i=1; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bU6ifl/btsBit5ROyb/Ah7ReUlTSmtCUnZx0jOMq1/img.png)
class Solution { public int solution(int[] numbers) { int answer = Integer.MIN_VALUE; //numbers 중 첫번째 값 선택 for(int i=0; i