Update README.md

ndb796 · web-flow · commit 6baeec0f0ff9 · 2020-11-02T14:09:07.000+09:00
diff --git a/README.md b/README.md
@@ -321,11 +321,11 @@
 
 ### &#52628;&#44032; &#51088;&#47308;
 
-* &#52293;&#50640;&#49436;&#45716; &#51088;&#49464;&#55176; &#45796;&#47336;&#51648; &#50506;&#51648;&#47564; &#46021;&#51088;&#51032; &#50836;&#52397;&#51004;&#47196; &#52628;&#44032;&#51201;&#51004;&#47196; &#51228;&#44277;&#54633;&#45768;&#45796;.
+> &#52293;&#50640;&#49436;&#45716; &#51088;&#49464;&#55176; &#45796;&#47336;&#51648; &#50506;&#51648;&#47564; &#46021;&#51088;&#51032; &#50836;&#52397;&#51004;&#47196; &#52628;&#44032;&#51201;&#51004;&#47196; &#51228;&#44277;&#54633;&#45768;&#45796;.
 
-1. &#53944;&#47532;(Tree)
-2. &#50864;&#49440;&#49692;&#50948; &#53328;(Priority Queue)
+* &#53944;&#47532;(Tree)
+* &#50864;&#49440;&#49692;&#50948; &#53328;(Priority Queue)
   * [&#50864;&#49440;&#49692;&#50948; &#53328; &#46972;&#51060;&#48652;&#47084;&#47532;&#47484; &#54876;&#50857;&#54620; &#55193; &#51221;&#47148;](https://www.acmicpc.net/problem/2751): ([Python 3.7 &#53076;&#46300;](/21/1.py) / [C++ &#53076;&#46300;](/21/1.cpp))
-3. &#51064;&#45937;&#49828; &#53944;&#47532;(Indexed Tree)
-4. &#48296;&#47564;-&#54252;&#46300;(Bellman-Ford) &#52572;&#45800; &#44221;&#47196; &#50508;&#44256;&#47532;&#51608;
-5. &#52572;&#49548; &#44277;&#53685; &#51312;&#49345;(Lowest Common Ancestor, LCA)
+* &#51064;&#45937;&#49828; &#53944;&#47532;(Indexed Tree)
+* &#48296;&#47564;-&#54252;&#46300;(Bellman-Ford) &#52572;&#45800; &#44221;&#47196; &#50508;&#44256;&#47532;&#51608;
+* &#52572;&#49548; &#44277;&#53685; &#51312;&#49345;(Lowest Common Ancestor, LCA)

-Original file line number
+Diff line change
 ### 추가 자료
 -* 책에서는 자세히 다루지 않지만 독자의 요청으로 추가적으로 제공합니다.
 +> 책에서는 자세히 다루지 않지만 독자의 요청으로 추가적으로 제공합니다.
 -1. 트리(Tree)
 -2. 우선순위 큐(Priority Queue)
 +* 트리(Tree)
 +* 우선순위 큐(Priority Queue)
   * [우선순위 큐 라이브러리를 활용한 힙 정렬](https://www.acmicpc.net/problem/2751): ([Python 3.7 코드](/21/1.py) / [C++ 코드](/21/1.cpp))
 -3. 인덱스 트리(Indexed Tree)
 -4. 벨만-포드(Bellman-Ford) 최단 경로 알고리즘
 -5. 최소 공통 조상(Lowest Common Ancestor, LCA)
 +* 인덱스 트리(Indexed Tree)
 +* 벨만-포드(Bellman-Ford) 최단 경로 알고리즘
 +* 최소 공통 조상(Lowest Common Ancestor, LCA)