mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"17.1K\", \"totalAcceptedRaw\": 7811, \"totalSubmissionRaw\": 17128, \"acRate\": \"45.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"17.2K\", \"totalAcceptedRaw\": 7830, \"totalSubmissionRaw\": 17178, \"acRate\": \"45.6%\"}",
|
||||
"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