mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 551,
|
||||
"likes": 557,
|
||||
"dislikes": 13,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Two Sum\", \"titleSlug\": \"two-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"K-diff Pairs in an Array\", \"titleSlug\": \"k-diff-pairs-in-an-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Finding Pairs With a Certain Sum\", \"titleSlug\": \"finding-pairs-with-a-certain-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count Equal and Divisible Pairs in an Array\", \"titleSlug\": \"count-equal-and-divisible-pairs-in-an-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"42.9K\", \"totalSubmission\": \"51.7K\", \"totalAcceptedRaw\": 42878, \"totalSubmissionRaw\": 51676, \"acRate\": \"83.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"52K\", \"totalAcceptedRaw\": 43134, \"totalSubmissionRaw\": 51975, \"acRate\": \"83.0%\"}",
|
||||
"hints": [
|
||||
"Can we check every possible pair?",
|
||||
"Can we use a nested for loop to solve this problem?"
|
||||
|
Reference in New Issue
Block a user