coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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/originData/count-primes.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"803K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 803037, \"totalSubmissionRaw\": 2404431, \"acRate\": \"33.4%\"}",
"stats": "{\"totalAccepted\": \"803.1K\", \"totalSubmission\": \"2.4M\", \"totalAcceptedRaw\": 803119, \"totalSubmissionRaw\": 2404689, \"acRate\": \"33.4%\"}",
"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.",