workbook 자동화

Author: seyeon22222

workbook/links.txt

@@ -1,34 +1,34 @@
 0x00,오리엔테이션 (문제집 X)
 0x01,기초 코드 작성 요령 I (문제집 X)
 0x02,기초 코드 작성 요령 II,https://www.acmicpc.net/workbook/view/7306
-0x03,배열,https://www.acmicpc.net/workbook/view/7307
-0x04,연결 리스트,https://www.acmicpc.net/workbook/view/7308
-0x05,스택,https://www.acmicpc.net/workbook/view/7309
-0x06,큐,https://www.acmicpc.net/workbook/view/7310
-0x07,덱,https://www.acmicpc.net/workbook/view/7311
+Array,배열,https://www.acmicpc.net/workbook/view/7307
+LinkedList,연결 리스트,https://www.acmicpc.net/workbook/view/7308
+Stack,스택,https://www.acmicpc.net/workbook/view/7309
+Queue,큐,https://www.acmicpc.net/workbook/view/7310
+Deque,덱,https://www.acmicpc.net/workbook/view/7311
 0x08,스택의 활용(수식의 괄호 쌍),https://www.acmicpc.net/workbook/view/7312
-0x09,BFS,https://www.acmicpc.net/workbook/view/7313
-0x0A,DFS (문제집 X)
-0x0B,재귀,https://www.acmicpc.net/workbook/view/7314
-0x0C,백트래킹,https://www.acmicpc.net/workbook/view/7315
-0x0D,시뮬레이션,https://www.acmicpc.net/workbook/view/7316
-0x0E,정렬 I,https://www.acmicpc.net/workbook/view/7317
-0x0F,정렬 II,https://www.acmicpc.net/workbook/view/7318
-0x10,다이나믹 프로그래밍,https://www.acmicpc.net/workbook/view/7319
-0x11,그리디,https://www.acmicpc.net/workbook/view/7320
+BFS,BFS,https://www.acmicpc.net/workbook/view/7313
+DFS,DFS (문제집 X)
+Recursion,재귀,https://www.acmicpc.net/workbook/view/7314
+BackTracking,백트래킹,https://www.acmicpc.net/workbook/view/7315
+Simulation,시뮬레이션,https://www.acmicpc.net/workbook/view/7316
+Sort1,정렬 I,https://www.acmicpc.net/workbook/view/7317
+Sort2,정렬 II,https://www.acmicpc.net/workbook/view/7318
+DynamicProgramming,다이나믹 프로그래밍,https://www.acmicpc.net/workbook/view/7319
+Greedy,그리디,https://www.acmicpc.net/workbook/view/7320
 0x12,수학,https://www.acmicpc.net/workbook/view/8174
-0x13,이분탐색,https://www.acmicpc.net/workbook/view/8400
-0x14,투 포인터,https://www.acmicpc.net/workbook/view/8709
-0x15,해시,https://www.acmicpc.net/workbook/view/9063
-0x16,이진 검색 트리,https://www.acmicpc.net/workbook/view/9346
+BinarySearch,이분탐색,https://www.acmicpc.net/workbook/view/8400
+TwoPointer,투 포인터,https://www.acmicpc.net/workbook/view/8709
+Hash,해시,https://www.acmicpc.net/workbook/view/9063
+BinarySearchTree,이진 검색 트리,https://www.acmicpc.net/workbook/view/9346
 0x17,우선순위 큐,https://www.acmicpc.net/workbook/view/9502
-0x18,그래프,https://www.acmicpc.net/workbook/view/9562
-0x19,트리,https://www.acmicpc.net/workbook/view/9657
-0x1A,위상 정렬,https://www.acmicpc.net/workbook/view/9738
+Graph,그래프,https://www.acmicpc.net/workbook/view/9562
+Tree,트리,https://www.acmicpc.net/workbook/view/9657
+TopologySort,위상 정렬,https://www.acmicpc.net/workbook/view/9738
 0x1B,최소 신장 트리,https://www.acmicpc.net/workbook/view/9907
-0x1C,플로이드 알고리즘,https://www.acmicpc.net/workbook/view/10318
-0x1D,다익스트라 알고리즘,https://www.acmicpc.net/workbook/view/10433
-0x1E,KMP,https://www.acmicpc.net/workbook/view/12205
+FloydWarshall,플로이드 알고리즘,https://www.acmicpc.net/workbook/view/10318
+Dijkstra,다익스트라 알고리즘,https://www.acmicpc.net/workbook/view/10433
+KMP,KMP,https://www.acmicpc.net/workbook/view/12205
 0x1F,트라이,https://www.acmicpc.net/workbook/view/12649
 Appendix A,문자열 기초,https://www.acmicpc.net/workbook/view/14409
 Appendix B,동적 배열 (문제집 X)