LeetCode 每日一题：868. 二进制间距

868. 二进制间距

// shiran
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, n, a) for (int i = n - 1; i >= a; i--)
#define sz(x) (int)size(x)
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
const int N = 110;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

class Solution
{
public:
    int binaryGap(int n)
    {
        int maxn = 0;
        per(i, 32, 0)
        {
            if (n >> i & 1)
            {
                int j = i - 1;
                while (j >= 0 && (n >> j & 1) == 0)
                    j--;
                if (j >= 0)
                    maxn = max(maxn, i - j);
                i = j + 1;
            }
        }
        return maxn;
    }
};