coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-23 05:48:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/maximum-score-of-a-good-subarray.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 4346, \"totalSubmissionRaw\": 10249, \"acRate\": \"42.4%\"}",
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"10.3K\", \"totalAcceptedRaw\": 4351, \"totalSubmissionRaw\": 10261, \"acRate\": \"42.4%\"}",
"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"