mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -137,7 +137,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"30K\", \"totalAcceptedRaw\": 18143, \"totalSubmissionRaw\": 30042, \"acRate\": \"60.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 18163, \"totalSubmissionRaw\": 30071, \"acRate\": \"60.4%\"}",
|
||||
"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."
|
||||
|
Reference in New Issue
Block a user