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/maximum-alternating-subsequence-sum.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 614,
"dislikes": 10,
"likes": 643,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Alternating Subarray Sum\", \"titleSlug\": \"maximum-alternating-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[4,2,5,3]\n[5,6,7,8]\n[6,2,1,2,4,5]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"25.1K\", \"totalAcceptedRaw\": 14764, \"totalSubmissionRaw\": 25058, \"acRate\": \"58.9%\"}",
"stats": "{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 15435, \"totalSubmissionRaw\": 26099, \"acRate\": \"59.1%\"}",
"hints": [
"Is only tracking a single sum enough to solve the problem?",
"How does tracking an odd sum and an even sum reduce the number of states?"