mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 717,
|
||||
"dislikes": 1049,
|
||||
"dislikes": 1050,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"String Compression\", \"titleSlug\": \"string-compression\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,2,3,4]\n[1,1,2,3]",
|
||||
@@ -137,7 +137,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"174.8K\", \"totalSubmission\": \"203.6K\", \"totalAcceptedRaw\": 174804, \"totalSubmissionRaw\": 203622, \"acRate\": \"85.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"175K\", \"totalSubmission\": \"203.9K\", \"totalAcceptedRaw\": 175012, \"totalSubmissionRaw\": 203857, \"acRate\": \"85.9%\"}",
|
||||
"hints": [
|
||||
"Decompress the given array by repeating nums[2*i+1] a number of times equal to nums[2*i]."
|
||||
],
|
||||
|
Reference in New Issue
Block a user