Remove rightmost set bit
suggest changeC-style bit-manipulation
template <typename T>
T rightmostSetBitRemoved(T n)
{
// static_assert(std::is_integral<T>::value && !std::is_signed<T>::value, "type should be unsigned"); // For c++11 and later
return n & (n - 1);
}
Explanation
- if
n
is zero, we have0 & 0xFF..FF
which is zero - else
n
can be written0bxxxxxx10..00
andn - 1
is0bxxxxxx011..11
, son & (n - 1)
is0bxxxxxx000..00
.
Found a mistake? Have a question or improvement idea?
Let me know.
Table Of Contents