coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/[no content]maximum-length-of-semi-decreasing-subarrays.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 2072, \"totalSubmissionRaw\": 2824, \"acRate\": \"73.4%\"}",
"stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 2086, \"totalSubmissionRaw\": 2844, \"acRate\": \"73.3%\"}",
"hints": [
"First, solve the problem assuming <code>nums</code> contains distinct values.",
"Make a new array with each element being the pair <code>(nums[i], i)</code> for every <code>i</code> and call it <code>num_ind</code>.",