일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
- X윈도우
- preprocessing
- Binary Search
- OOP
- Inheritance
- 자바
- 리눅스
- descriptive statistics
- Operator
- selenium
- 리눅스 마스터 1급
- Entity
- Mac
- Java
- Class
- BFS
- X.org
- python
- spring
- 셀레니움
- Polymolphism
- Physical Scheme
- literal
- dbms
- systemd
- Entity Set
- External Scheme
- Unity
- Reference Type
- 백준
- Today
- Total
목록Algorithm (28)
Byeol Lo
import java.io.IOException; import java.io.InputStreamReader; import java.io.BufferedReader; import java.util.StringTokenizer; import java.util.HashMap; import java.util.PriorityQueue; import java.util.Arrays; public class Main { static final BufferedReader BR = new BufferedReader(new InputStreamReader(System.in)); static HashMap graph; static int[] dist1, dist2; static StringTokenizer st; stati..
import java.io.IOException; import java.io.InputStreamReader; import java.io.BufferedReader; import java.io.OutputStreamWriter; import java.io.BufferedWriter; import java.util.StringTokenizer; import java.util.Arrays; import java.util.HashMap; import java.util.Map; import java.util.PriorityQueue; public class Main { static final BufferedReader BR = new BufferedReader(new InputStreamReader(System..
다익스트라를 처음 접한 나는 3일간 코드를 봤고 무척 힘들었다... 가장 핵심은 priority queue를 이용해 방문할 node들에서 "최소 거리 혹은 점수"를 가지는 애를 넣어야 한다는 것이다. package dijkstra; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.*; public class N17396 { static final BufferedReader BR = new BufferedReader(new InputStreamReader(System.in)); static List[] nodes; static long[] dist; publi..
import java.io.IOException; import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.StringTokenizer; import java.util.HashMap; import java.util.ArrayList; public class Main { private static final BufferedReader BR = new BufferedReader(new InputStreamReader(System.in)); private static final BufferedWriter ..
import java.io.IOException; import java.io.OutputStreamWriter; import java.io.BufferedWriter; import java.util.*; public class Main { private static final BufferedWriter BW = new BufferedWriter(new OutputStreamWriter(System.out)); private static final StringBuffer SB = new StringBuffer(); private static Scanner SC = new Scanner(System.in); public static void main(String[] args) throws IOExceptio..
import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.io.BufferedReader; import java.io.BufferedWriter; public class Main { private static final BufferedReader BR = new BufferedReader(new InputStreamReader(System.in)); private static final BufferedWriter BW = new BufferedWriter(new OutputStreamWriter(System.out)); private static final String..
import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStreamWriter; import java.util.Scanner; public class Main { private static final BufferedWriter BW = new BufferedWriter(new OutputStreamWriter(System.out)); private static final Scanner SC = new Scanner(System.in); private static final StringBuffer SB = new StringBuffer(""); public static void main(String[] args) thr..
다음은 일반적인 병합 정렬 알고리즘이다. import java.io.IOException; import java.io.InputStreamReader; import java.io.BufferedReader; import java.util.ArrayList; import java.util.StringTokenizer; public class Main { private static final BufferedReader BR = new BufferedReader(new InputStreamReader(System.in)); private static final ArrayList LOG = new ArrayList(); private static StringTokenizer st; private static i..
원래 의도는 다음과 같은 자료구조를 구현하는 것이다. package stack; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.Deque; import java.util.StringTokenizer; import java.util.ArrayList; import java.util.LinkedList; public class N24511 { final static BufferedReader BR = new BufferedReader(new InputStreamReader(System.in)); final static StringBuffer SB = new S..
DoublyLinkedList를 문제에 적합하게 필요한 요구사항만 구현하도록 하는게 큰 관건이였다. inner class를 static으로 두고 super class가 이를 사용해 구현을 할 수 있다. 더 생각하면 Node의 setNext와 setPrev를 없앨 수 있을거 같은데, 그건 추후에 하도록 하겠다.(수정 완료) import java.io.IOException; import java.io.InputStreamReader; import java.io.BufferedReader; import java.util.*; public class Main { static final BufferedReader BR = new BufferedReader(new InputStreamReader(System.in)..