백준 1254 팰린드롬 만들기
·
Codding_Test/BaekJoon
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class baekjoon_1254 { public static void main(String[] args) throws IOException { // readLine 사용 시 예외처리 필수 BufferedReader in = new BufferedReader(new InputStreamReader(System.in)); String str = in.readLine(); int answer = str.length(); for (int i = 0; i < str.length(); i++) { if(isPalind(str.subst..
요세푸스 백준(1158)
·
Codding_Test/BaekJoon
import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class baekjoon_1158 { public static void main(String[] args) { Scanner sc= new Scanner(System.in); Queue q = new LinkedList(); int n = sc.nextInt(); int k = sc.nextInt(); String answer = ""; for (int i = 1; i
최소, 최대 백준(10818)
·
Codding_Test/BaekJoon
import java.util.ArrayList; import java.util.Arrays; import java.util.Scanner; public class arrayMinMax { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] arr = new int[N]; for (int i = 0; i < N; i++) { arr[i] = sc.nextInt(); } Arrays.sort(arr); System.out.println(arr[0] + " " + arr[arr.length - 1]); } }