C 解法, 执行用时: 2ms, 内存消耗: 292KB, 提交时间: 2022-01-27

#include <stdio.h>

int main() {
    int a;
    while(scanf("%d",&a) != EOF) {
        int max = 0, currentMax = 0;
        while (a > 0){
           if ((a & 0x1) == 1) {
               currentMax++;
               if (currentMax > max) {
                   max = currentMax;
               }
           } else {
               currentMax = 0;
           }
           a = a >> 1;
        }
        printf("%d\n",max);
    }
}

C 解法, 执行用时: 2ms, 内存消耗: 296KB, 提交时间: 2022-02-09

#include <stdio.h>
int main()
{
    int n,i,j,m,k,max,count[100],x;
    while(scanf("%d",&n)!=EOF)
    {
        for(j=0;j<100;j++)
        {
            count[j]= 0;
        }
        i = 0;
        x = 0;
        m = n;
        while(m!=0) //先转换为二进制数
        {
            k = n%2;
            if(k==1)
            {
                count[x]++;
            }
            else
            {
                x++;
            }
            m = n/2;
            n = m;
        }
        max = count[0];
        for(j=1;j<=x;j++)//选出最大连续的
        {
            if(count[j]>max)
            {
                max = count[j];
            }
        }
        printf("%d\n",max);
    }
    return 0;
}