coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +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-cn/originData/minimum-operations-to-make-the-array-increasing.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"40.9K\", \"totalSubmission\": \"50.5K\", \"totalAcceptedRaw\": 40863, \"totalSubmissionRaw\": 50488, \"acRate\": \"80.9%\"}",
"stats": "{\"totalAccepted\": \"40.9K\", \"totalSubmission\": \"50.5K\", \"totalAcceptedRaw\": 40865, \"totalSubmissionRaw\": 50490, \"acRate\": \"80.9%\"}",
"hints": [
"nums[i+1] must be at least equal to nums[i] + 1.",
"Think greedily. You don't have to increase nums[i+1] beyond nums[i]+1.",