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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/number-of-sub-arrays-with-odd-sum.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 731,
"likes": 732,
"dislikes": 30,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Subsequence of Size K With the Largest Even Sum\", \"titleSlug\": \"subsequence-of-size-k-with-the-largest-even-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"51.2K\", \"totalAcceptedRaw\": 22290, \"totalSubmissionRaw\": 51218, \"acRate\": \"43.5%\"}",
"stats": "{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"51.3K\", \"totalAcceptedRaw\": 22321, \"totalSubmissionRaw\": 51296, \"acRate\": \"43.5%\"}",
"hints": [
"Can we use the accumulative sum to keep track of all the odd-sum sub-arrays ?",
"if the current accu sum is odd, we care only about previous even accu sums and vice versa."