1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 717,
"dislikes": 1050,
"likes": 734,
"dislikes": 1069,
"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\": \"175K\", \"totalSubmission\": \"203.9K\", \"totalAcceptedRaw\": 175012, \"totalSubmissionRaw\": 203857, \"acRate\": \"85.9%\"}",
"stats": "{\"totalAccepted\": \"177.8K\", \"totalSubmission\": \"207K\", \"totalAcceptedRaw\": 177769, \"totalSubmissionRaw\": 206973, \"acRate\": \"85.9%\"}",
"hints": [
"Decompress the given array by repeating nums[2*i+1] a number of times equal to nums[2*i]."
],