Update 323._number_of_connected_components_in_an_undirected_graph.md

Author: 0xkookoo

docs/Leetcode_Solutions/Python/323._number_of_connected_components_in_an_undirected_graph.md

@@ -1,5 +1,5 @@
 #  323. Number of Connected Components in an Undirected Graph
-**<font color=red>难度: 中等</font>**
+**<font color=red>难度: Medium</font>**
 
 ## 刷题内容
 
@@ -38,7 +38,7 @@ You can assume that no duplicate edges will appear in edges. Since all edges are
 
 > 思路 1
 
-经典并查集题目，可以去总结部分先看看并查集的概念已经优化
+经典并查集题目，可以去总结部分先看看并查集的概念以及优化
 
 
 ```python