์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |
- ํจ์คํธ์บ ํผ์ค ์ปดํจํฐ๊ณตํ ์์ฃผ๋ฐ
- http
- ๋๋ฆผ์ฝ๋ฉ
- HTTP ์๋ฒฝ๊ฐ์ด๋
- ์ง ๊ตฌํ๊ธฐ
- ๊น์ํ JPA
- js promise
- JPA ์ฐ๊ด๊ด๊ณ ๋งคํ
- js array
- ์ดํํฐ๋ธ์๋ฐ
- ์ดํํฐ๋ธ์๋ฐ ์คํฐ๋
- java
- BOJ
- Quick Sort
- ๋ฐฑ๊ธฐ์ ์คํฐ๋
- REST API
- ์ดํํฐ๋ธ์๋ฐ ์์ดํ 59
- ํ๋ก๊ทธ๋๋จธ์ค
- Spring Security
- ์ค๋ ๋
- ๋ฐฑ์ค
- ์ดํํฐ๋ธ์๋ฐ ์์ดํ 60
- js api
- HTTP ์๋ฒฝ ๊ฐ์ด๋
- ๊น์ํ http
- ์๋ฃ๊ตฌ์กฐ
- ๋ชจ๋์๋ฐ์คํฌ๋ฆฝํธ
- JS ๋ฅ๋ค์ด๋ธ
- dreamcoding
- ํ๋ก๊ทธ๋๋จธ์ค SQL
- Today
- 19
- Total
- 10,275
๋ชฉ๋ก๋ฐฑ์ค (34)
kingsubin
import java.io.*; import java.util.*; public class Main { static int N, M, person1, person2, x, y; static LinkedList[] nodeList; static boolean[] visited; static boolean check; static class Node { int index; int distance; public Node(int index, int distance) { this.index = index; this.distance = distance; } } public static void bfs(int start, int end) { Queue q = new LinkedList(); q.offer(new No..
import java.io.*; import java.util.*; public class Main { static int N, M; static int[][] graph; static int[] dx = {-1, 1, 0, 0}; static int[] dy = {0, 0, -1, 1}; // x,y ์ขํ๊ฐ ํจ๊ป ์์ง์ผํ๊ณ , ๋ ์ง๋ฅผ ์ธ์ผํ๋๋ฐ ๊ทธ๊ฑธ ํด๋์ค ์์ ๋ฃ์์ static class Dot { int x; int y; int day; public Dot(int x, int y, int day) { this.x = x; this.y = y; this.day = day; } } public static void main(String[] args) throws IOException { input();..
import java.io.*; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; class Node { int index; int distance; public Node(int index, int distance) { this.index = index; this.distance = distance; } public int getIndex() { return index; } public int getDistance() { return distance; } } public class Main { static int n, m, nx, ny; static int[][] graph = new int[101]..
import java.io.*; import java.util.StringTokenizer; public class Main { static int t, m, n, k, x, y, ans; static int[][] graph = new int[50][50]; public static boolean dfs(int x, int y) { if (x < 0 || x >= m || y < 0 || y >= n) { return false; } if (graph[x][y] == 1) { graph[x][y] = 0; dfs(x - 1, y); dfs(x + 1, y); dfs(x, y - 1); dfs(x, y + 1); return true; } return false; } public static void m..
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int n, danjiCnt; static int[][] graph = new int[26][26]; static int[] num = new int[26*26]; static boolean dfs (int x, int y) { if (x < 1 || x > n || y < 1 || y > n) { return false; } // ๋จ์ง๊ฐ ๋ ์ ์๋ค๋ฉด if (graph[x][y] == 1) { graph[x][y] = 0; num[danjiCnt]++; d..
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int n, m, node1, node2, cnt; static LinkedList[] nodeList; static boolean[] visited = new boolean[101]; public static void dfs(int node) { if (visited[node]) return; visited[node] = true; cnt++; for (int nextNode : nodeList[node]) { dfs(nextNode); } } public..
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { static int n, m, v; static LinkedList[] nodeList; static boolean[] checked = new boolean[1001]; static boolean[] checked2 = new boolean[1001]; public static void dfs(int node) { if (checked[node]) return; checked[node] = true; System.out.print(node + " "); for (int..
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.*; public class Main { public static int n, m, k, x; public static ArrayList graph = new ArrayList(); // ๋ชจ๋ ๋์์ ๋ํ ์ต๋จ ๊ฑฐ๋ฆฌ ์ด๊ธฐํ public static int[] d = new int[300001]; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(S..