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": 503,
|
||||
"likes": 504,
|
||||
"dislikes": 138,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -137,7 +137,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"38.1K\", \"totalSubmission\": \"80.1K\", \"totalAcceptedRaw\": 38071, \"totalSubmissionRaw\": 80064, \"acRate\": \"47.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"38.1K\", \"totalSubmission\": \"80.2K\", \"totalAcceptedRaw\": 38096, \"totalSubmissionRaw\": 80159, \"acRate\": \"47.5%\"}",
|
||||
"hints": [
|
||||
"If X is the first i digits of the array as a binary number, then 2X + A[i] is the first i+1 digits."
|
||||
],
|
||||
|
Reference in New Issue
Block a user