coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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

2
leetcode/originData/minimum-one-bit-operations-to-make-integers-zero.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 9784, \"totalSubmissionRaw\": 15725, \"acRate\": \"62.2%\"}",
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"15.8K\", \"totalAcceptedRaw\": 9805, \"totalSubmissionRaw\": 15760, \"acRate\": \"62.2%\"}",
"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."