【Leetcode_easy】868. Binary Gap

problem

868. Binary Gap

solution1:

class Solution {
public:
    int binaryGap(int N) {
        int res = ;
        vector<int> pos;
        int k = ;
        while(N>)
        {
            if(N&==) pos.push_back(k);
            k++;
            N >>=;//errr...
        }
        for(int i=; i<pos.size(); ++i)
        {
            res = max(res, pos[i]-pos[i-]);
        }
        return res;
    }
};

solution2:

class Solution {
public:
    int binaryGap(int N) {
        int res = , last = -, k = ;
        while(N>)
        {
            if(N&==)
            {
                if(last>=) res = max(res, k-last);
                last = k;
            }
            N>>=;//errr...
            k++;
        }
        return res;
    }
};

参考
1. Leetcode_easy_868. Binary Gap;

2. Grandyang;

完