算法之位运算

分析和思路：遍历数字的每一位，遇到1的时候，进入while循环，用一个变量保存最大值，并更新

#include <iostream>
#include "iostream"

using namespace std;

int main()
{
    int number = 0;
    while (cin >> number)
    {
        int a = 1;

        int max = 0;
        while (a <= number)
        {//2
            int count = 0;
            if (number&a)
            {//1
                while (number&a)
                {
                    count++;
                    a = a << 1;

                }
                if (max < count)
                {
                    max = count;
                }
            }//1
            else
            {
                a = a << 1;
            }
        }//2 
        cout << max << endl;
    }

    return 0;

}