coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 22:38: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/plates-between-candles.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"31.3K\", \"totalSubmission\": \"72.5K\", \"totalAcceptedRaw\": 31323, \"totalSubmissionRaw\": 72501, \"acRate\": \"43.2%\"}",
"stats": "{\"totalAccepted\": \"31.3K\", \"totalSubmission\": \"72.5K\", \"totalAcceptedRaw\": 31343, \"totalSubmissionRaw\": 72547, \"acRate\": \"43.2%\"}",
"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?"