coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/running-sum-of-1d-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 2443,
"dislikes": 176,
"likes": 2533,
"dislikes": 177,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4]\n[1,1,1,1,1]\n[3,1,2,10,1]",
@@ -125,7 +125,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"500.2K\", \"totalSubmission\": \"558.7K\", \"totalAcceptedRaw\": 500240, \"totalSubmissionRaw\": 558677, \"acRate\": \"89.5%\"}",
"stats": "{\"totalAccepted\": \"510.7K\", \"totalSubmission\": \"570.1K\", \"totalAcceptedRaw\": 510698, \"totalSubmissionRaw\": 570059, \"acRate\": \"89.6%\"}",
"hints": [
"Think about how we can calculate the i-th number in the running sum from the (i-1)-th number."
],