Codility经典算法题之一 ：binary gap

Codility（code+ablity）是一个主要面向面试者的OJ （online judge）平台，(Codility OJ is a platform for preparing technical coding interviews)。

目前coldility网站一共有63道经典算法题，网址：https://app.codility.com/programmers/lessons 

本博将会把题目以及我自己写的（这类会标注为原创），实在不会的是粘贴的其他版主的（这类会标注为转载）python版本的答案记录下来，与其说是答案，其实是一种思路，而且几乎不满足时间和空间复杂度，并且最终的测试也达不到100%（好难过），仅供python算法爱好者参考，如果大牛有好点子，请不吝赐教。

Task description:

A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N.

For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation 10100 and contains one binary gap of length 1. The number 15 has binary representation 1111 and has no binary gaps.

Write a function:

class Solution { public int solution(int N); }

that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap.

For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5.

Assume that:

• N is an integer within the range [1..2,147,483,647].

Complexity:

• expected worst-case time complexity is O(log(N));
• expected worst-case space complexity is O(1).

Solution:

def solution(N):

    cnt = 0
    result = 0
    found_one = False
    i = N
    while i:
        print(i)
        if i & 1 == 1:
            if (found_one == False):
                found_one = True
            else:
                result = max(result,cnt)
            cnt = 0
        else:
            cnt += 1
        i >>= 1
    return result