coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 13:06:47 +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

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3.5K\", \"totalAcceptedRaw\": 1389, \"totalSubmissionRaw\": 3508, \"acRate\": \"39.6%\"}",
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 1425, \"totalSubmissionRaw\": 3584, \"acRate\": \"39.8%\"}",
"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])",