본문 바로가기

Coding Test

(221)
[백준/자바] 1157 - 단어 공부 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String word = br.readLine().toUpperCase(); int[] count = new int[26]; char[] arr = word.toCharArray(); for(char c : arr){ int index = c - 65; count[ind..
[백준/자바] 2444 - 별 찍기 - 7 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for(int i=1; i0; i--){ System.out.println(" ".repeat(n - i) + "*".repeat(2 * i - 1)); } sc.close(); } }
[백준/자바] 10828 - 스택 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { private static int[] stack; private static int size = 0; private static StringBuilder sb = new StringBuilder(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine())..
[프로그래머스/자바] 타겟 넘버 class Solution { public int solution(int[] numbers, int target) { return new NumberOfCases(numbers, target).calc(); } } class NumberOfCases { private final int[] numbers; private final int target; public NumberOfCases(int[] numbers, int target) { this.numbers = numbers; this.target = target; } int calc() { return calc(0, 0); } private int calc(int depth, int sum) { if (depth == numbers.length) r..
[프로그래머스/자바] 순위 검색 import java.util.ArrayList; import java.util.HashMap; import java.util.List; import java.util.Map; class Solution { public int[] solution(String[] info, String[] query) { int[] answer = new int[query.length]; Map map = makeIndex(info); for(int i=0; i< query.length; i++){ int index = query[i].lastIndexOf(" "); String key = query[i].substring(0, index); int score = Integer.parseInt(query[i].substr..
[백준/자바] 2751 - 수 정렬하기 2 import java.io.*; import java.util.ArrayList; import java.util.Collections; import java.util.List; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int n = Integer.parseInt(br.readLine()); List list = new ArrayList();..
[백준/자바] 1920 - 수 찾기 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.HashSet; import java.util.Set; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); Set set = new HashSet(); int n = Integer.parseInt(br.readLine()); String[] arr1 = br.readLine().split("..
[프로그래머스/자바] 특정한 문자를 대문자로 바꾸기 class Solution { public String solution(String my_string, String alp) { String s = String.valueOf((char)(alp.charAt(0) - 32)); return my_string.replaceAll(alp, s); } }