给定n,求使n < 2^m成立的最小m
unsigned int fixsize( unsigned int n ) {
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
return n + 1;
}
本文提供了一个高效的算法来计算给定整数n,使得n小于2的m次方成立的最小m值。通过位操作优化计算过程,实现快速求解。
给定n,求使n < 2^m成立的最小m
unsigned int fixsize( unsigned int n ) {
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
return n + 1;
}
3730
518

被折叠的 条评论
为什么被折叠?