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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/sign-of-the-product-of-an-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 481,
"dislikes": 67,
"likes": 523,
"dislikes": 70,
"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\": \"82.1K\", \"totalSubmission\": \"122.3K\", \"totalAcceptedRaw\": 82071, \"totalSubmissionRaw\": 122258, \"acRate\": \"67.1%\"}",
"stats": "{\"totalAccepted\": \"90.6K\", \"totalSubmission\": \"135.3K\", \"totalAcceptedRaw\": 90582, \"totalSubmissionRaw\": 135272, \"acRate\": \"67.0%\"}",
"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"