位运算中的二分

最新推荐文章于 2024-07-19 19:11:19 发布

_不会dp不改名_

最新推荐文章于 2024-07-19 19:11:19 发布

阅读量341

点赞数 8

分类专栏： # 二分文章标签：算法

本文链接：https://blog.csdn.net/bdn_nbd/article/details/136644703

版权

二分专栏收录该内容

8 篇文章 0 订阅

订阅专栏

本文介绍了C++编译器中的内置函数`__clz`,`__ctz`,和`__ffsdi2`，它们分别用于计算整数的前导零、尾随零和最左侧1位的索引。作者提供了自定义的二分搜索算法实现，并解释了这些函数在解决LeetCode问题中的应用。

摘要由CSDN通过智能技术生成

0. 起源

做leetcode1261官解使用了一个编译器自带函数__builtin_clz来计算前导零。

搜索引擎搜出一篇博客自己写了下这个功能函数，把代码贴在这里。

1. 代码片

// Returns the number of leading 0-bits in x, starting at the most significant bit position.
// If x is zero, the result is undefined.
int __clzsi2(unsigned x);
int __clzsi2(unsigned x)
{
  // This uses a binary search (counting down) algorithm from Hacker's Delight.
   unsigned y;
   int n = 32;
   y = x >>16;  if (y != 0) {n = n -16;  x = y;}
   y = x >> 8;  if (y != 0) {n = n - 8;  x = y;}
   y = x >> 4;  if (y != 0) {n = n - 4;  x = y;}
   y = x >> 2;  if (y != 0) {n = n - 2;  x = y;}
   y = x >> 1;  if (y != 0) return n - 2;
   return n - x;
}

// Returns the number of trailing 0-bits in x, starting at the least significant bit position.
// If x is zero, the result is undefined.
int __ctzsi2(unsigned x);
int __ctzsi2(unsigned x)
{
  // This uses a binary search algorithm from Hacker's Delight.
  int n = 1;
  if ((x & 0x0000FFFF) == 0) {n = n +16; x = x >>16;}
  if ((x & 0x000000FF) == 0) {n = n + 8; x = x >> 8;}
  if ((x & 0x0000000F) == 0) {n = n + 4; x = x >> 4;}
  if ((x & 0x00000003) == 0) {n = n + 2; x = x >> 2;}
  return n - (x & 1);
}

// Returns the index of the least significant 1-bit in x, or the value zero if x is zero.
// The least significant bit is index one.
int __ffsdi2 (unsigned x);
int __ffsdi2 (unsigned x)
{
  return (x == 0) ? 0 : __builtin_ctz(x) + 1;
}