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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/count-pairs-of-nodes.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 194,
"dislikes": 122,
"likes": 197,
"dislikes": 123,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "4\n[[1,2],[2,4],[1,3],[2,3],[2,1]]\n[2,3]\n5\n[[1,5],[1,5],[3,4],[2,5],[1,3],[5,1],[2,3],[2,5]]\n[1,2,3,4,5]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11.4K\", \"totalAcceptedRaw\": 4252, \"totalSubmissionRaw\": 11414, \"acRate\": \"37.3%\"}",
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 4330, \"totalSubmissionRaw\": 11576, \"acRate\": \"37.4%\"}",
"hints": [
"We want to count pairs (x,y) such that degree[x] + degree[y] - occurrences(x,y) > k",
"Think about iterating on x, and counting the number of valid y to pair with x.",