mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"26K\", \"totalSubmission\": \"42.6K\", \"totalAcceptedRaw\": 25965, \"totalSubmissionRaw\": 42608, \"acRate\": \"60.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"26K\", \"totalSubmission\": \"42.6K\", \"totalAcceptedRaw\": 25967, \"totalSubmissionRaw\": 42610, \"acRate\": \"60.9%\"}",
|
||||
"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