coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01: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/originData/maximum-score-of-a-good-subarray.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"68.1K\", \"totalSubmission\": \"105.2K\", \"totalAcceptedRaw\": 68118, \"totalSubmissionRaw\": 105249, \"acRate\": \"64.7%\"}",
"stats": "{\"totalAccepted\": \"68.1K\", \"totalSubmission\": \"105.3K\", \"totalAcceptedRaw\": 68126, \"totalSubmissionRaw\": 105260, \"acRate\": \"64.7%\"}",
"hints": [
"Try thinking about the prefix before index k and the suffix after index k as two separate arrays.",
"Using two pointers or binary search, we can find the maximum prefix of each array where the numbers are less than or equal to a certain value"