coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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/maximum-product-difference-between-two-pairs.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 387,
"dislikes": 19,
"likes": 409,
"dislikes": 21,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[5,6,2,7,4]\n[4,2,5,9,7,4,8]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"46.4K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 46390, \"totalSubmissionRaw\": 57080, \"acRate\": \"81.3%\"}",
"stats": "{\"totalAccepted\": \"48.5K\", \"totalSubmission\": \"59.7K\", \"totalAcceptedRaw\": 48507, \"totalSubmissionRaw\": 59662, \"acRate\": \"81.3%\"}",
"hints": [
"If you only had to find the maximum product of 2 numbers in an array, which 2 numbers should you choose?",
"We only need to worry about 4 numbers in the array."