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:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/count-primes.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"265.3K\", \"totalSubmission\": \"715.5K\", \"totalAcceptedRaw\": 265287, \"totalSubmissionRaw\": 715480, \"acRate\": \"37.1%\"}",
"stats": "{\"totalAccepted\": \"265.3K\", \"totalSubmission\": \"715.5K\", \"totalAcceptedRaw\": 265303, \"totalSubmissionRaw\": 715544, \"acRate\": \"37.1%\"}",
"hints": [
"Checking all the integers in the range [1, n - 1] is not efficient. Think about a better approach.",
"Since most of the numbers are not primes, we need a fast approach to exclude the non-prime integers.",