feat: add 2nd solution to lc problems with c++ codes: No.2685

Author: DengSchoo

solution/2600-2699/2685.Count the Number of Complete Components/README.md

@@ -238,8 +238,6 @@ func countCompleteComponents(n int, edges [][]int) (ans int) {
 
 ### 方法二：取巧做法
 
-> [我的题解](https://leetcode.cn/problems/count-the-number-of-complete-components/solutions/2269282/zui-jian-ji-jie-fa-c-stlzuo-fa-by-dengsc-rw5e/)
-
 要解决的问题：
 
 1. 如何保存每一个节点与其它点联通状态

solution/2600-2699/2685.Count the Number of Complete Components/README_EN.md

@@ -226,8 +226,6 @@ func countCompleteComponents(n int, edges [][]int) (ans int) {
 
 ### 方法二：Simple Method 
 
-> [My Solution Link](https://leetcode.cn/problems/count-the-number-of-complete-components/solutions/2269282/zui-jian-ji-jie-fa-c-stlzuo-fa-by-dengsc-rw5e/)
-
 Problems needed to solve：
 
 1. How do we maintain the link state between each node and the others? 如