Codility-BinaryGap

最新推荐文章于 2021-03-28 16:28:53 发布

原创最新推荐文章于 2021-03-28 16:28:53 发布 · 873 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法来寻找一个正整数二进制表示中由1包围的最大连续0序列长度。通过逐步去除最低位直到遇到1开始计数，并在遇到下个1时记录最长序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

依据除2取余法为思路。

1.先除2至第一个为1的位置。

2.统计至下一个为1位置中间0的个数。

3.比较，取个数最多的结果。

classSolution {
    publicint solution(int N){
        // write your code in C# 6.0 with .NET 4.5 (Mono)
        int Temp=0,Max=0;
        for(;N%2!=1;N/=2){}
        for(;N!=1;N/=2)
        {
            if(N%2==1){Temp=0;}
            else{Temp++;}
            if(Temp>Max){Max=Temp;}
        }
        return Max;
    }
}