https://www.acmicpc.net/problem/16165 Hashmap을 사용한 문제. hash 관련 메서드들을 암기하자. 기본적으로 put, get, remove가 있다. // 결과 값이 boolean으로 반환된다. boolean hasApple = map.containsKey("apple");boolean hasValue = map.containsValue(1);// HashMap에 있는 모든 키들을 Set으로 반환.Set keys = map.keySet();// HashMap의 모든 키-값 쌍을 Set>로 반환Set> entries = map.entrySet();// 주어진 키가 존재하면 해당 값을 반환하고, 존재하지 않으면 defaultValue를 반환Integer value = ..
Algorithm/Backjoon
https://www.acmicpc.net/problem/12904Solution package Algo_스터디.August_2주차;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class bj12904 { static boolean flag = false; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String First = br.readLine(..
https://www.acmicpc.net/problem/2211 Solution package GOLD;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;import java.util.*;class dot implements Comparable{ int from, to, value; public dot(int from, int to, int value){ this.from = from; this.to = to; this.value = value; } @Override p..
https://www.acmicpc.net/problem/19238 Solution package GOLD;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.*;public class 스타트택시test { static int[][] dir = new int[][]{{0,-1},{0,1},{1,0},{-1,0}}; static boolean[][] visit; static int[][] road; static int N; public static void main(String[] args) throws IOException { ..
https://www.acmicpc.net/problem/14888 Solution package SILVER;import java.io.*;import java.util.*;public class bj14888 { static int max = Integer.MIN_VALUE; static int min = Integer.MAX_VALUE; static int N; static int[] numbers; static int[] operator; public static void main(String[] args) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(S..
https://www.acmicpc.net/problem/1931 Solutionpackage SILVER;import java.io.*;import java.util.*;public class 회의실배정 { public static void main(String[] args)throws IOException { BufferedReader br =new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); int[][] schedule = new int[N][2]; for(int i=0; i(){ @Override ..
https://www.acmicpc.net/problem/7576 Solution package GOLD;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class 토마토 { static int[][] dir = new int[][]{{0,-1},{0,1},{1,0},{-1,0}}; public static void main(String[] args) throws IOException { BufferedRead..
https://www.acmicpc.net/problem/5014 Solution package SILVER;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.PriorityQueue;import java.util.Queue;import java.util.StringTokenizer;public class 스타트링크 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.i..
https://www.acmicpc.net/problem/7562 Solution package SILVER;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.*;public class 나이트의이동 { static int[][] dir = new int[][]{{-2,-1},{-1,-2},{2,-1},{1,-2},{1,2},{2,1},{-2,1},{-1,2}}; static boolean[][] visit; public static void main(String[] args) throws IOException { BufferedReade..
