coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/k-concatenation-maximum-sum.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 864,
"dislikes": 83,
"likes": 894,
"dislikes": 86,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2]\n3\n[1,-2,1]\n5\n[-1,-2]\n7",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.8K\", \"totalSubmission\": \"98.7K\", \"totalAcceptedRaw\": 23790, \"totalSubmissionRaw\": 98686, \"acRate\": \"24.1%\"}",
"stats": "{\"totalAccepted\": \"24.2K\", \"totalSubmission\": \"100.3K\", \"totalAcceptedRaw\": 24197, \"totalSubmissionRaw\": 100320, \"acRate\": \"24.1%\"}",
"hints": [
"How to solve the problem for k=1 ?",
"Use Kadane's algorithm for k=1.",