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-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

4
leetcode/originData/[no content]number-of-valid-subarrays.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 170,
"likes": 175,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Smooth Descent Periods of a Stock\", \"titleSlug\": \"number-of-smooth-descent-periods-of-a-stock\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"8.2K\", \"totalAcceptedRaw\": 6060, \"totalSubmissionRaw\": 8245, \"acRate\": \"73.5%\"}",
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"8.4K\", \"totalAcceptedRaw\": 6165, \"totalSubmissionRaw\": 8382, \"acRate\": \"73.6%\"}",
"hints": [
"Given a data structure that answers queries of the type to find the minimum in a range of an array (Range minimum query (RMQ) sparse table) in O(1) time. How can you solve this problem?",
"For each starting index do a binary search with an RMQ to find the ending possible position."