【python3】leetcode 868. Binary Gap（easy）

最新推荐文章于 2019-08-20 17:07:15 发布

momottyy

最新推荐文章于 2019-08-20 17:07:15 发布

阅读量131

点赞数

分类专栏： leetcode python

本文链接：https://blog.csdn.net/maotianyi941005/article/details/86213464

版权

leetcode 同时被 2 个专栏收录

126 篇文章 0 订阅

订阅专栏

python

120 篇文章 0 订阅

订阅专栏

868. Binary Gap（easy）

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.

其实这道题主要点在考如何转二进制吧？？奈何python大法好。。直接有bin()方法。。不过bin方法转的二进制前面两位是0b表示这是一个二进制串，所以需去掉

class Solution:
    def binaryGap(self, N):
        """
        :type N: int
        :rtype: int
        """
        binN = bin(N)[2:]
        dis = 0
        pre1 = -1
        for i in range(len(binN)):
            if binN[i] == '1':
                if pre1 == -1: pre1 = i
                else:
                    dis = max(dis,i - pre1)
                    pre1 = i
        return dis

思考：如何自己转二进制

cclass Solution:
    def binaryGap(self, N):
        """
        :type N: int
        :rtype: int
        """

        dis = 0
        pre1 = -1

        binN = []
        while(N > 0):
            binN.insert(0,N%2)
            N = int(N/2)
        for i in range(len(binN)):
            if binN[i] == 1:
                if pre1 == -1: pre1 = i
                else:
                    dis = max(dis,i - pre1)
                    pre1 = i    
        return dis