coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 565,
"likes": 568,
"dislikes": 24,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Largest Rectangle in Histogram\", \"titleSlug\": \"largest-rectangle-in-histogram\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"25.2K\", \"totalAcceptedRaw\": 12966, \"totalSubmissionRaw\": 25224, \"acRate\": \"51.4%\"}",
"stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"25.3K\", \"totalAcceptedRaw\": 12996, \"totalSubmissionRaw\": 25276, \"acRate\": \"51.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"