We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2237a16 commit 9b9ec14Copy full SHA for 9b9ec14
README.md
@@ -325,7 +325,7 @@
325
326
1. 트리(Tree)
327
2. 우선순위 큐(Priority Queue)
328
- * [우선순위 큐 라이브러리를 활용한 힙 정렬](https://www.acmicpc.net/problem/2751): ([Python 3.7 코드](/21/1.py) / [C++ 코드](/21/1.cpp))
+ * [우선순위 큐 라이브러리를 활용한 힙 정렬](https://www.acmicpc.net/problem/2751): ([Python 3.7 코드](/21/1.py) / [C++ 코드](/21/1.cpp))
329
3. 인덱스 트리(Indexed Tree)
330
4. 벨만-포드(Bellman-Ford) 최단 경로 알고리즘
331
5. 최소 공통 조상(Lowest Common Ancestor, LCA)
0 commit comments