1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-03 14:32:54 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 863,
"likes": 880,
"dislikes": 49,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"46.1K\", \"totalSubmission\": \"96.7K\", \"totalAcceptedRaw\": 46110, \"totalSubmissionRaw\": 96694, \"acRate\": \"47.7%\"}",
"stats": "{\"totalAccepted\": \"47.3K\", \"totalSubmission\": \"98.9K\", \"totalAcceptedRaw\": 47260, \"totalSubmissionRaw\": 98871, \"acRate\": \"47.8%\"}",
"hints": [
"Keep all prefix products of numbers in an array, then calculate the product of last K elements in O(1) complexity.",
"When a zero number is added, clean the array of prefix products."