coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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/range-sum-of-sorted-subarray-sums.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 540,
"dislikes": 101,
"likes": 568,
"dislikes": 105,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4]\n4\n1\n5\n[1,2,3,4]\n4\n3\n4\n[1,2,3,4]\n4\n1\n10",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"40.4K\", \"totalAcceptedRaw\": 23854, \"totalSubmissionRaw\": 40436, \"acRate\": \"59.0%\"}",
"stats": "{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"41.4K\", \"totalAcceptedRaw\": 24462, \"totalSubmissionRaw\": 41391, \"acRate\": \"59.1%\"}",
"hints": [
"Compute all sums and save it in array.",
"Then just go from LEFT to RIGHT index and calculate answer modulo 1e9 + 7."