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/originData/minimum-one-bit-operations-to-make-integers-zero.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"54.8K\", \"totalSubmission\": \"73.2K\", \"totalAcceptedRaw\": 54849, \"totalSubmissionRaw\": 73177, \"acRate\": \"75.0%\"}",
"stats": "{\"totalAccepted\": \"54.9K\", \"totalSubmission\": \"73.2K\", \"totalAcceptedRaw\": 54860, \"totalSubmissionRaw\": 73193, \"acRate\": \"75.0%\"}",
"hints": [
"The fastest way to convert n to zero is to remove all set bits starting from the leftmost one. Try some simple examples to learn the rule of how many steps are needed to remove one set bit.",
"consider n=2^k case first, then solve for all n."