Shawn’s Blog
🗂️ Collections
🖥️ Slides Gallery
🧠 Q&A Knowledge Base
💻 LeetCode Notes
🧑🍳️ Cooking Ideas
🍱 Cookbook
💬 Language Learning
🎼 Music Library
⚙️ Projects
⚛ Continual Learning Arena
📄 Papers
AdaHAT
FG-AdaHAT
AmnesiacHAT
🎓 CV
CV (English)
CV (Mandarin)
About
比特位计数
Counting Bits
位运算
2025/10/16
思路:简单遍历,每次和一个log2 i 异或。对于
\(O(n)\)
的算法,应该是有某种固定规律(递推公式),比较麻烦,不愿意想
评价:思路完全正确
Back to top