Webastor - Programming Tips and Tricks

Programming language => Python => Topic started by: Lee on November 17, 2016, 07:04:54 PM

Title: What is the most efficient method to find a sequence of N zero bits in a std::bitset (even better if we can specify a start index)?
Post by: Lee on November 17, 2016, 07:04:54 PM
Hi everyone, I'd like to ask you a question, what is the most efficient method to find a sequence of n zero bits in a std::bitset (even better if we can specify a start index)? It is urgent, I thank you please give me a hand quickly.