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 e4726f9 commit 0a756cbCopy full SHA for 0a756cb
solution/2600-2699/2685.Count the Number of Complete Components/README.md
@@ -251,16 +251,16 @@ func countCompleteComponents(n int, edges [][]int) (ans int) {
251
252
拿示例一举例:
253
254
-- 5包含的联通点有且只有自己,所以是连通图
255
-- 0包含0、1、2,同理1、2点也是
256
-- 3和4也是包含自己和彼此
257
-- 基于以上就有以下代码实现:
+- 5 包含的联通点有且只有自己,所以是连通图
+- 0 包含 0、1、2,同理 1、2 点也是
+- 3 和 4 也是包含自己和彼此
+- 基于以上就有以下代码实现:
258
259
<!-- tabs:start -->
260
261
#### C++
262
263
-```c++
+```cpp
264
class Solution {
265
public:
266
int countCompleteComponents(int n, vector<vector<int>>& edges) {
@@ -285,7 +285,6 @@ public:
285
return ans;
286
}
287
};
288
-// cost:283ms、beats 5%.
289
```
290
291
<!-- tabs:end -->
0 commit comments