coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-03 14:32:54 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/[no content]number-of-single-divisor-triplets.json
View File

@@ -28,7 +28,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"382\", \"totalSubmission\": \"668\", \"totalAcceptedRaw\": 382, \"totalSubmissionRaw\": 668, \"acRate\": \"57.2%\"}",
"stats": "{\"totalAccepted\": \"386\", \"totalSubmission\": \"680\", \"totalAcceptedRaw\": 386, \"totalSubmissionRaw\": 680, \"acRate\": \"56.8%\"}",
"hints": [
"The maximum value of nums.length is very large, but the maximum value of nums[i] is not.",
"Count the number of times each value appears in nums. Brute force through every possible combination of values and count how many single divisor triplets can be made with that combination of values."