기록하기록

1. 복사 배열을 만든다. 2. 순회하면서 값과 인덱스를 저장하는 해시맵을 구성한다. 3. 해당 값을 꺼내 출력한다. import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); HashMap hashMap = new HashMap(); int n = Integer.parseInt(br.readLine()); int [] answer = new int [n]; StringTokenizer st = new StringTokenize..

import java.io.IOException; import java.util.*; class Main { public static void main(String[] args) throws IOException { int l = 13; int r = 17; System.out.println(solution(l,r)); } public static int solution(int left, int right) { int answer = 0; for (int i = left; i

import java.io.IOException; import java.util.*; class Main { public static void main(String[] args) throws IOException { int [] arr = {1,2,3,4,6,7,8,0}; System.out.println(solution(arr)); System.out.println(solution2(arr)); } public static int solution(int[] numbers) { int answer = 0; int [] ans = new int[10]; for (int i = 0; i < numbers.length; i++) { ans[numbers[i]]++; } for (int i = 0; i < an..

개선 전 코드(정답이긴 함) import java.io.IOException; import java.util.*; class Main { public static void main(String[] args) throws IOException { String [] id_list = {"muzi", "frodo", "apeach", "neo"}; String [] report = {"muzi frodo","apeach frodo","frodo neo","muzi neo","apeach muzi"}; int k = 2; for (int i : solution(id_list, report, k)) { System.out.printf("%d ", i); } } public static int [] solution..

import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int s = 0; StringBuilder sb = new StringBuilder(); while (n-->0) { StringTokenizer st = new StringTokenize..

재귀에 대해 걍 가볍게 짚고 넘어가볼 수 있는 문제였다. import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); n = Integer.parseInt(br.readLine()); System.out.println("어느 한 컴퓨터공학과 학생이 유명한 교수님을 찾아가 물었다."); solution(0); } static..

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int [] arr = new int[47]; arr[0] = 0; arr[1] = 1; for (int i = 2; i < 47; i++) { arr[i] = arr[i-1] + arr[i-2]; } Syst..

같은 문제인데 걍 보자마자 풀렸다. 이래서 많이 푸는건가 싶었다. import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTok..

import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.*; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken()); int m = Integer.parseInt(st.nextToken()); HashMap hashMap = ne..

import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.Collections; import java.util.PriorityQueue; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); // 가장 큰 수일수록 앞에 나온다. PriorityQueue pq = new PriorityQueue(Collections.reverseOrder()); int n = Integer.parseInt(br.read..