coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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

6
leetcode/originData/remove-one-element-to-make-the-array-strictly-increasing.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 453,
"dislikes": 193,
"likes": 456,
"dislikes": 194,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,10,5,7]\n[2,3,1,2]\n[1,1,1]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"87.2K\", \"totalAcceptedRaw\": 23910, \"totalSubmissionRaw\": 87235, \"acRate\": \"27.4%\"}",
"stats": "{\"totalAccepted\": \"24K\", \"totalSubmission\": \"87.7K\", \"totalAcceptedRaw\": 24026, \"totalSubmissionRaw\": 87694, \"acRate\": \"27.4%\"}",
"hints": [
"For each index i in nums remove this index.",
"If the array becomes sorted return true, otherwise revert to the original array and try different index."