mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 478,
|
||||
"dislikes": 66,
|
||||
"likes": 481,
|
||||
"dislikes": 67,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[-1,-2,-3,-4,3,2,1]\n[1,5,0,2,-3]\n[-1,1,-1,1,-1]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"81.3K\", \"totalSubmission\": \"121.1K\", \"totalAcceptedRaw\": 81276, \"totalSubmissionRaw\": 121104, \"acRate\": \"67.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"82.1K\", \"totalSubmission\": \"122.3K\", \"totalAcceptedRaw\": 82071, \"totalSubmissionRaw\": 122258, \"acRate\": \"67.1%\"}",
|
||||
"hints": [
|
||||
"If there is a 0 in the array the answer is 0",
|
||||
"To avoid overflow make all the negative numbers -1 and all positive numbers 1 and calculate the prod"
|
||||
|
Reference in New Issue
Block a user