coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/[no content]brightest-position-on-street.json
View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 79,
"likes": 86,
"dislikes": 2,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Number of Buckets Required to Collect Rainwater from Houses\", \"titleSlug\": \"minimum-number-of-buckets-required-to-collect-rainwater-from-houses\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"similarQuestions": "[{\"title\": \"Minimum Number of Buckets Required to Collect Rainwater from Houses\", \"titleSlug\": \"minimum-number-of-buckets-required-to-collect-rainwater-from-houses\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count Positions on Street With Required Brightness\", \"titleSlug\": \"count-positions-on-street-with-required-brightness\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[-3,2],[1,2],[3,3]]\n[[1,0],[0,1]]\n[[1,2]]",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"3.8K\", \"totalAcceptedRaw\": 2387, \"totalSubmissionRaw\": 3812, \"acRate\": \"62.6%\"}",
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"4.2K\", \"totalAcceptedRaw\": 2619, \"totalSubmissionRaw\": 4169, \"acRate\": \"62.8%\"}",
"hints": [
"Convert lights into an array of ranges representing the range where each street light can light up and sort the start and end points of the ranges.",
"Do we need to traverse all possible positions on the street?",