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-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-cn/originData/[no content]number-of-valid-subarrays.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 34,
"likes": 35,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3.1K\", \"totalAcceptedRaw\": 2233, \"totalSubmissionRaw\": 3102, \"acRate\": \"72.0%\"}",
"stats": "{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 2317, \"totalSubmissionRaw\": 3215, \"acRate\": \"72.1%\"}",
"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."