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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 359,
"likes": 361,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find First and Last Position of Element in Sorted Array\", \"titleSlug\": \"find-first-and-last-position-of-element-in-sorted-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Can Make Palindrome from Substring\", \"titleSlug\": \"can-make-palindrome-from-substring\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"20.8K\", \"totalAcceptedRaw\": 9681, \"totalSubmissionRaw\": 20826, \"acRate\": \"46.5%\"}",
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"21K\", \"totalAcceptedRaw\": 9738, \"totalSubmissionRaw\": 20954, \"acRate\": \"46.5%\"}",
"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?"