868. Binary Gap

868. Binary Gap

---

题目

Leetcode题目

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，再求相邻1的距离，从这些距离取最大值。

利用bitset可以将将N从十进制转化为二进制。

• 时间复杂度：O(1)
• 空间复杂度：O(1)

class Solution {
public:
    int binaryGap(int N) {
        int result = 0;
        bitset<32> num(N);
        int flag = -1;
        for (int i = 0; i < 32; i++) {
            if (num.test(i)) {
                // 判断该数位是否为1
                if (flag == -1) {
                    flag = i;
                } else {
                    result = max(result, i - flag);
                    flag = i;
                }
            }
        }
        return result;
    }
};