mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 193,
|
||||
"likes": 194,
|
||||
"dislikes": 122,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"11.4K\", \"totalAcceptedRaw\": 4238, \"totalSubmissionRaw\": 11392, \"acRate\": \"37.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11.4K\", \"totalAcceptedRaw\": 4252, \"totalSubmissionRaw\": 11414, \"acRate\": \"37.3%\"}",
|
||||
"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.",
|
||||
|
Reference in New Issue
Block a user