coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +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

2
leetcode-cn/originData/[no content]maximum-of-minimum-values-in-all-subarrays.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"236\", \"totalSubmission\": \"457\", \"totalAcceptedRaw\": 236, \"totalSubmissionRaw\": 457, \"acRate\": \"51.6%\"}",
"stats": "{\"totalAccepted\": \"258\", \"totalSubmission\": \"489\", \"totalAcceptedRaw\": 258, \"totalSubmissionRaw\": 489, \"acRate\": \"52.8%\"}",
"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.",