868. Binary Gap（python+cpp）

题目：

Given a positive integer N, find and return the longest distance between two consecutive 1’s in the binary representation of N.
If there aren’t two consecutive 1’s, return 0.

Example 1: 
Input: 22
Output: 2 
Explanation:  
22 in binary is 0b10110. In the binary representation of 22, there are three ones, and two consecutive pairs of 1's. The first consecutive pair of 1's have distance 2. The second consecutive pair of 1's have distance 1. The answer is the largest of these two distances, which is 2. 

Example 2: 
Input: 5 
Output: 2
Explanation:  5 in binary is 0b101. 

Example 3: 
Input: 6 
Output: 1
Explanation:  6 in binary is 0b110. 

Example 4: 
Input: 8 
Output: 0
Explanation:  8 in binary is 0b1000. There aren't any consecutive pairs of 1's in the binary representation of 8, so we return 0. 

Note:
1 <= N <= 10^9

解释：
返回数字N的二进制表示的最近的两个’1’之间的最大距离。
直接用两个指针即可。
python代码：

class Solution(object):
    def binaryGap(self, N):
        """
        :type N: int
        :rtype: int
        """
        binstr=bin(N)[2:]
        i=0
        k=-1
        result=0
        while binstr[i]=='0':
            i+=1
        while i<len(binstr):
            if binstr[i]=='1':
                k+=1
                result=max(result,k)
                k=0
            else:
                k+=1
            i+=1
        return result 

但是我觉得转成二进制不是这类题目的常规解法。
用index来做，从右往左遍历一遍N的二进制表示，d表示和上一个1的距离，用一个很小的值来初始化，比如-32，用python解很方便，结合zip()函数，用列表表达式直接求出来indexs，从右往左还是从左往右无所谓；c++可以用除以2来表示右移一位，如果当前值%2==1则表示最后一位的bit是1，这样的求法是从右往左求的。

class Solution:
    def binaryGap(self, N):
        """
        :type N: int
        :rtype: int
        """
        indexs=[i for i,v in enumerate(bin(N)) if v=='1']
        return max([b-a for a ,b in zip(indexs,indexs[1:])] or[0])

用c++实现类似的思想

class Solution {
public:
    int binaryGap(int N) {
        int res=0;
        for (int d=-32;N;N/=2,d++)
        {
            if (N%2)
            {
                res=max(res,d);
                d=0;
            }
        }
        return res;
    }
};

总结：
关于二进制的题目一定要学会使用位运算，比如移位、异或，这里用到了简单的移位操作，移位操作本质上就是乘除运算。