coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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/partition-array-such-that-maximum-difference-is-k.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 9000, \"totalSubmissionRaw\": 13147, \"acRate\": \"68.5%\"}",
"stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 9001, \"totalSubmissionRaw\": 13148, \"acRate\": \"68.5%\"}",
"hints": [
"Which values in each subsequence matter? The only values that matter are the maximum and minimum values.",
"Let the maximum and minimum values of a subsequence be Max and Min. It is optimal to place all values in between Max and Min in the original array in the same subsequence as Max and Min.",