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/tuple-with-same-product.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 397,
"dislikes": 18,
"likes": 406,
"dislikes": 19,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[2,3,4,6]\n[1,2,4,5,10]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 18163, \"totalSubmissionRaw\": 30071, \"acRate\": \"60.4%\"}",
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 18486, \"totalSubmissionRaw\": 30574, \"acRate\": \"60.5%\"}",
"hints": [
"Note that all of the integers are distinct. This means that each time a product is formed it must be formed by two unique integers.",
"Count the frequency of each product of 2 distinct numbers. Then calculate the permutations formed."