二进制位运算

1.序言

根据上述性质可知，a|0 = a；a^0 = a; &和1<<可以用来寻找a的二进制中第几位为0

2.例题

1.判断二进制中1的个数
https://leetcode-cn.com/problems/er-jin-zhi-zhong-1de-ge-shu-lcof/
2.减法实现除法
https://leetcode-cn.com/problems/xoh6Oh/
3.求数组中两个仅出现一次的数(详解)
https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/
4.求数组中仅出现一次的数
https://leetcode-cn.com/problems/WGki4K/
5.& 、| 用法详解
https://leetcode-cn.com/problems/aseY1I/
6.不用乘除、循环等计算1+2+…+n
https://leetcode-cn.com/problems/qiu-12n-lcof/
7.数值的整数次方
https://leetcode-cn.com/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/
8.二进制求和
https://leetcode-cn.com/problems/bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof/