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:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/reverse-subarray-to-maximize-array-value.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 461,
"likes": 463,
"dislikes": 54,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 5422, \"totalSubmissionRaw\": 13071, \"acRate\": \"41.5%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 5423, \"totalSubmissionRaw\": 13072, \"acRate\": \"41.5%\"}",
"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])",