mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-03 14:32:54 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 861,
|
||||
"likes": 863,
|
||||
"dislikes": 49,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"46K\", \"totalSubmission\": \"96.4K\", \"totalAcceptedRaw\": 45979, \"totalSubmissionRaw\": 96432, \"acRate\": \"47.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"46.1K\", \"totalSubmission\": \"96.7K\", \"totalAcceptedRaw\": 46110, \"totalSubmissionRaw\": 96694, \"acRate\": \"47.7%\"}",
|
||||
"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."
|
||||
|
Reference in New Issue
Block a user