coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +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

4
leetcode/originData/find-the-smallest-divisor-given-a-threshold.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1294,
"likes": 1296,
"dislikes": 150,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimized Maximum of Products Distributed to Any Store\", \"titleSlug\": \"minimized-maximum-of-products-distributed-to-any-store\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"79.1K\", \"totalSubmission\": \"148.1K\", \"totalAcceptedRaw\": 79139, \"totalSubmissionRaw\": 148079, \"acRate\": \"53.4%\"}",
"stats": "{\"totalAccepted\": \"79.3K\", \"totalSubmission\": \"148.3K\", \"totalAcceptedRaw\": 79269, \"totalSubmissionRaw\": 148281, \"acRate\": \"53.5%\"}",
"hints": [
"Examine every possible number for solution. Choose the largest of them.",
"Use binary search to reduce the time complexity."