mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-22 21:46:46 +08:00
update
This commit is contained in:
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"6.4K\", \"totalSubmission\": \"12.8K\", \"totalAcceptedRaw\": 6361, \"totalSubmissionRaw\": 12800, \"acRate\": \"49.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 6523, \"totalSubmissionRaw\": 13056, \"acRate\": \"50.0%\"}",
|
||||
"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