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]maximum-of-minimum-values-in-all-subarrays.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 81,
"dislikes": 15,
"likes": 87,
"dislikes": 24,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[0,1,2,4]\n[10,20,50,10]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.2K\", \"totalAcceptedRaw\": 1133, \"totalSubmissionRaw\": 2219, \"acRate\": \"51.1%\"}",
"stats": "{\"totalAccepted\": \"1.3K\", \"totalSubmission\": \"2.7K\", \"totalAcceptedRaw\": 1349, \"totalSubmissionRaw\": 2651, \"acRate\": \"50.9%\"}",
"hints": [
"Imagine the array is empty, and each element is coming to its index one by one, starting with the smallest element.",
"For each coming element nums[i], calculate L and R, the indices of the first smallest elements on the left and the right respectively.",