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

2
leetcode-cn/originData/maximum-beauty-of-an-array-after-applying-operation.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 6455, \"totalSubmissionRaw\": 16326, \"acRate\": \"39.5%\"}",
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 6458, \"totalSubmissionRaw\": 16330, \"acRate\": \"39.5%\"}",
"hints": [
"Sort the array.",
"The problem becomes the following: find maximum subarray A[i … j] such that A[j] - A[i] ≤ 2 * k."