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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"9.8K\", \"totalAcceptedRaw\": 3808, \"totalSubmissionRaw\": 9782, \"acRate\": \"38.9%\"}",
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"9.8K\", \"totalAcceptedRaw\": 3813, \"totalSubmissionRaw\": 9789, \"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])",