868. Binary Gap

 

 

 

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.

实际上是求1位置减法的最大值。

后面俩Time limited:

class Solution:
    def binaryGap(self, N):
        """
        :type N: int
        :rtype: int
        """
        dis=[]
        n=str(bin(N))[2:]
        j=1
        for i in range(len(n)):
            if int(n[i])== 1 :
                while j <= len(n) :
                    if int(n[j]) == 0 :
                        j=j+1
                    else:
                        dis.append(j-i)
                if not dis: return 0
        return max(dis)
         
 

class Solution:
    def binaryGap(self, N):
        """
        :type N: int
        :rtype: int
        """
        n = str(bin(N)[2:])
        j=1
        d = {}
        longest = 0
        for i in range(len(n)):
            if n[i] == '1':
                while j < len(n):
                    if n[j]=='1':
                        value=j-i
                        if value>longest:
                            longest=value
        return longest             

把while 改了，可以过：

class Solution:
    def binaryGap(self, N):
        """
        :type N: int
        :rtype: int
        """
        n = bin(N)[2:]
        d = {} //建空字典
        longest = 0
        for i in range(len(n)):
            if n[i] == '1':
                if 1 in d:
                    val = i - d[1]
                    if val > longest:
                        longest = val
                d[1] = i  //顺序不能变
        return longest