coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/minimum-degree-of-a-connected-trio-in-a-graph.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"51.3K\", \"totalAcceptedRaw\": 21578, \"totalSubmissionRaw\": 51298, \"acRate\": \"42.1%\"}",
"stats": "{\"totalAccepted\": \"21.6K\", \"totalSubmission\": \"51.3K\", \"totalAcceptedRaw\": 21580, \"totalSubmissionRaw\": 51301, \"acRate\": \"42.1%\"}",
"hints": [
"Consider a trio with nodes u, v, and w. The degree of the trio is just degree(u) + degree(v) + degree(w) - 6. The -6 comes from subtracting the edges u-v, u-w, and v-w, which are counted twice each in the vertex degree calculation.",
"To get the trios (u,v,w), you can iterate on u, then iterate on each w,v such that w and v are neighbors of u and are neighbors of each other."