[LeetCode&Python] Problem 868. Binary Gap

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了[LeetCode&Python] Problem 868. Binary Gap，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1021字，纯文字阅读大概需要2分钟。

内容图文

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

class Solution:
    def binaryGap(self, N):
        """
        :type N: int
        :rtype: int
        """
        bN=bin(N)[2:]
        
        n=len(bN)
        
        ans=0
        preOne=-1
        
        for i in range(n):
            if bN[i]=='1':
                if preOne==-1:
                    preOne=i
                else:
                    if ans<=(i-preOne):
                        ans=(i-preOne)
                    preOne=i
        
        return ans

内容总结

以上是互联网集市为您收集整理的[LeetCode&Python] Problem 868. Binary Gap全部内容，希望文章能够帮你解决[LeetCode&Python] Problem 868. Binary Gap所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端