coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-19 02:24:59 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 12738, \"totalSubmissionRaw\": 16174, \"acRate\": \"78.8%\"}",
"stats": "{\"totalAccepted\": \"12.8K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 12767, \"totalSubmissionRaw\": 16215, \"acRate\": \"78.7%\"}",
"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.",