Update 685._Redundant_Connection_II.md

Author: 0xkookoo

docs/Leetcode_Solutions/685._Redundant_Connection_II.md

@@ -37,7 +37,7 @@ class Solution(object):
         def find(node_parent, parent):
             return parent if node_parent[parent] == parent else find(node_parent, node_parent[parent])
 
-        n, count = len(edges), 0 # Use count to track the number of the invalid edge.
+        n, count = len(edges), 0 # 用 count 来计数不合法的边
         node_parent = [i for i in range(n+1)]
         res = [0, 0]