3950. Exactly One Consecutive Set Bits Pair

You are given an integer n.

Return true if its binary representation contains exactly one adjacent pair of set bits, and false otherwise.

class Solution {
public:
    bool consecutiveSetBits(int n) {
        int ok = 0;
        while(n) {
            if((n & 3) == 3) ok++;
            n /= 2;
        }
        return ok == 1;
    }
};