coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/minimum-operations-to-make-the-array-increasing.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 532,
"likes": 533,
"dislikes": 29,
"isLiked": null,
"similarQuestions": "[]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"39.7K\", \"totalSubmission\": \"50.7K\", \"totalAcceptedRaw\": 39674, \"totalSubmissionRaw\": 50725, \"acRate\": \"78.2%\"}",
"stats": "{\"totalAccepted\": \"39.8K\", \"totalSubmission\": \"50.9K\", \"totalAcceptedRaw\": 39783, \"totalSubmissionRaw\": 50854, \"acRate\": \"78.2%\"}",
"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.",