Leetcode 600. Non-negative Integers without Consecutive Ones

Count how many integers in [0, n] have binary representations that never contain consecutive 1s; this is typically solved by scanning n's bits and using a Fibonacci-like digit-DP over bit positions to count valid prefixes in O(number of bits) time.