coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +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/abbreviating-the-product-of-a-range.json
View File

@@ -12,9 +12,9 @@
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 52,
"dislikes": 91,
"dislikes": 94,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Factorial Trailing Zeroes\", \"titleSlug\": \"factorial-trailing-zeroes\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"similarQuestions": "[{\"title\": \"Factorial Trailing Zeroes\", \"titleSlug\": \"factorial-trailing-zeroes\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Trailing Zeros in a Cornered Path\", \"titleSlug\": \"maximum-trailing-zeros-in-a-cornered-path\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "1\n4\n2\n11\n371\n375",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 1815, \"totalSubmissionRaw\": 6417, \"acRate\": \"28.3%\"}",
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"6.7K\", \"totalAcceptedRaw\": 1886, \"totalSubmissionRaw\": 6659, \"acRate\": \"28.3%\"}",
"hints": [
"Calculating the number of trailing zeros, the last five digits, and the first five digits can all be done separately.",
"Use a prime factorization property to find the number of trailing zeros. Use modulo to find the last 5 digits. Use a logarithm property to find the first 5 digits.",