Java: Bitwise operation for flag checking

谁说胖子不能爱 提交于 2019-12-05 18:30:20

You can check if any bit is set using this code that I found here.

if (x & (1<<n) != 0) {
  //n-th bit is set
}
else {
  //n-th bit is not set
}

x is the number you wish to check, and n is the bit you want to check. The algorithm works by left-shifting the number 1 by n, and AND-ing it with x.

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!