coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21: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/sum-of-all-odd-length-subarrays.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1846,
"dislikes": 151,
"likes": 1922,
"dislikes": 156,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,4,2,5,3]\n[1,2]\n[10,11,12]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"88.2K\", \"totalSubmission\": \"105.9K\", \"totalAcceptedRaw\": 88192, \"totalSubmissionRaw\": 105910, \"acRate\": \"83.3%\"}",
"stats": "{\"totalAccepted\": \"93.5K\", \"totalSubmission\": \"112.1K\", \"totalAcceptedRaw\": 93467, \"totalSubmissionRaw\": 112052, \"acRate\": \"83.4%\"}",
"hints": [
"You can brute force – try every (i,j) pair, and if the length is odd, go through and add the sum to the answer."
],