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

4
leetcode/originData/design-a-stack-with-increment-operation.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1068,
"likes": 1073,
"dislikes": 67,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"65.9K\", \"totalSubmission\": \"85.5K\", \"totalAcceptedRaw\": 65912, \"totalSubmissionRaw\": 85517, \"acRate\": \"77.1%\"}",
"stats": "{\"totalAccepted\": \"66K\", \"totalSubmission\": \"85.7K\", \"totalAcceptedRaw\": 66050, \"totalSubmissionRaw\": 85699, \"acRate\": \"77.1%\"}",
"hints": [
"Use an array to represent the stack. Push will add new integer to the array. Pop removes the last element in the array and increment will add val to the first k elements of the array.",
"This solution run in O(1) per push and pop and O(k) per increment."