coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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/reverse-subarray-to-maximize-array-value.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 327,
"dislikes": 33,
"likes": 331,
"dislikes": 34,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[2,3,1,5,4]\n[2,4,9,24,2,1,10]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"9.8K\", \"totalAcceptedRaw\": 3813, \"totalSubmissionRaw\": 9789, \"acRate\": \"39.0%\"}",
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 3844, \"totalSubmissionRaw\": 9861, \"acRate\": \"39.0%\"}",
"hints": [
"What's the score after reversing a sub-array [L, R] ?",
"It's the score without reversing it + abs(a[R] - a[L-1]) + abs(a[L] - a[R+1]) - abs(a[L] - a[L-1]) - abs(a[R] - a[R+1])",