coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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-good-meals.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"93.5K\", \"totalAcceptedRaw\": 33629, \"totalSubmissionRaw\": 93526, \"acRate\": \"36.0%\"}",
"stats": "{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"93.5K\", \"totalAcceptedRaw\": 33630, \"totalSubmissionRaw\": 93529, \"acRate\": \"36.0%\"}",
"hints": [
"Note that the number of powers of 2 is at most 21 so this turns the problem to a classic find the number of pairs that sum to a certain value but for 21 values",
"You need to use something fasters than the NlogN approach since there is already the log of iterating over the powers so one idea is two pointers"