Question

How to find the length of the longest consecutive zeroes in the binary representation of a number in C++

Answer 1

#include <iostream>
#include <bitset>
#include <string>

int longestConsecutiveZeroes(int n) {
    std::string binary = std::bitset<16>(n).to_string(); // Convert to 16-bit binary string
    int maxCount = 0, currentCount = 0;

    for (char bit : binary) {
        if (bit == '0') {
            currentCount++;
            maxCount = std::max(maxCount, currentCount);
        } else {
            currentCount = 0;
        }
    }

    return maxCount;
}

int main() {
    int num = 11298; // 0010 1100 0010 0010

    std::cout << "Longest consecutive zeroes: " << longestConsecutiveZeroes(num) << std::endl;
}

 
 
/*
run:
 
Longest consecutive zeroes: 4
 
*/

 

70+ SQL courses for beginners and professionals

Answer 2

#include <iostream>

int longestConsecutiveZeroes(int n) {
    int maxCount = 0, currentCount = 0;

    while (n > 0) {
        if ((n & 1) == 0) { // Check if the least significant bit is 0
            currentCount++;
            maxCount = std::max(maxCount, currentCount);
        } else {
            currentCount = 0; // Reset count when a 1 is encountered
        }
        n >>= 1; // Right shift the number
    }

    return maxCount;
}

int main() {
    int num = 11298; // 0010 1100 0010 0010
    
    std::cout << "Longest consecutive zeroes: " << longestConsecutiveZeroes(num) << std::endl;
}

 
 
/*
run:
 
Longest consecutive zeroes: 4
 
*/

 

70+ SQL courses for beginners and professionals