coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21: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/plates-between-candles.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"34.9K\", \"totalSubmission\": \"80.2K\", \"totalAcceptedRaw\": 34927, \"totalSubmissionRaw\": 80182, \"acRate\": \"43.6%\"}",
"stats": "{\"totalAccepted\": \"34.9K\", \"totalSubmission\": \"80.2K\", \"totalAcceptedRaw\": 34929, \"totalSubmissionRaw\": 80184, \"acRate\": \"43.6%\"}",
"hints": [
"Can you find the indices of the most left and right candles for a given substring, perhaps by using binary search (or better) over an array of indices of all the bars?",
"Once the indices of the most left and right bars are determined, how can you efficiently count the number of plates within the range? Prefix sums?"