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/maximize-sum-of-array-after-k-negations.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 936,
"dislikes": 78,
"likes": 961,
"dislikes": 79,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find Subsequence of Length K With the Largest Sum\", \"titleSlug\": \"find-subsequence-of-length-k-with-the-largest-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[4,2,3]\n1\n[3,-1,0,2]\n3\n[2,-3,-1,5,-4]\n2",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"52.5K\", \"totalSubmission\": \"102.1K\", \"totalAcceptedRaw\": 52526, \"totalSubmissionRaw\": 102064, \"acRate\": \"51.5%\"}",
"stats": "{\"totalAccepted\": \"53.6K\", \"totalSubmission\": \"104.3K\", \"totalAcceptedRaw\": 53640, \"totalSubmissionRaw\": 104281, \"acRate\": \"51.4%\"}",
"hints": [],
"solution": null,
"status": null,