C++, Non-DP, O(32) Fibonacci solution

  • 15

    The solution is based on 2 facts:

    1. the number of length k string without consecutive 1 is Fibonacci sequence f(k);
      For example, if k = 5, the range is 00000-11111. We can consider it as two ranges, which are 00000-01111 and 10000-10111. Any number >= 11000 is not allowed due to consecutive 1. The first case is actually f(4), and the second case is f(3), so f(5)= f(4)+f(3).
    2. Scan the number from most significant digit, i.e. left to right, in binary format. If we find a '1' with k digits to the right, count increases by f(k) because we can put a '0' at this digit and any valid length k string behind; After that, we continue the loop to consider the remaining cases, i.e., we put a '1' at this digit. If consecutive 1s are found, we exit the loop and return the answer. By the end of the loop, we return count+1 to include the number n itself.
      For example, if n is 10010110,
      we find first '1' at 7 digits to the right, we add range 00000000-01111111, which is f(7);
      second '1' at 4 digits to the right, add range 10000000-10001111, f(4);
      third '1' at 2 digits to the right, add range 10010000-10010011, f(2);
      fourth '1' at 1 digits to the right, add range 10010100-10010101, f(1);
      Those ranges are continuous from 00000000 to 10010101. And any greater number <= n will have consecutive 1.
    class Solution {
        int findIntegers(int num) {
            int f[32];
            f[0] = 1;
            f[1] = 2;
            for (int i = 2; i < 32; ++i)
                f[i] = f[i-1]+f[i-2];
            int ans = 0, k = 30, pre_bit = 0;
            while (k >= 0) {
                if (num&(1<<k)) {
                    ans += f[k];
                    if (pre_bit) return ans;
                    pre_bit = 1;
                    pre_bit = 0;
            return ans+1;

  • 0

    Thanks! This is the most simple solution and clear explanation.

  • 0

    @zestypanda Brilliant thought and elegant implementation!

  • 0

    @zestypanda Great solution! Quick question:

    And why do you think that this is "non-DP"?

    Thank you!

  • 0

    @sumer Personally I think dp is that in order to solve a problem of n, we solve subproblems with m smaller than n first. The logic here is more like a loop. You can call Fibonacci number part dp.

  • 0


Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.