面试题 05.04. 下一个数（c++/位运算）

class Solution {
public:
    vector<int> findClosedNumbers(int num) {
        //bitset构造时，需在<>中表明bitset 的大小(即size)。在进行有参构造时，若参数的二进制表示比bitset的size小，则在前面用０补充(如上面的栗子)；若比bitsize大，参数为整数时取后面部分，参数为字符串
        bitset<32>smaller(num);
        bitset<32>bigger(num);

        int s = -1;
        for(int i = 1;i < 32; i++){
            //从右往左找第一个10，转换为01
            if(smaller[i] == 1 && smaller[i-1] == 0){
                smaller.flip(i);
                smaller.flip(i-1);
                for(int left = i-2,right = 0;right < left;){
                    while(right < left && smaller[left] == 1){
                        left--;
                    }
                    while(right < left && smaller[right] == 0){
                        right++;
                    }
                    smaller.flip(left);
                    smaller.flip(right);
                }
                s = (int)smaller.to_ulong();
                break;
            }
        }

        int b = -1;
        for(int i = 1;i < 31;i++){//2147483647=2^31-1,不能循环到32位，会溢出
            if(bigger[i] == 0 && bigger[i-1] ==1){
                bigger.flip(i);
                bigger.flip(i-1);
                for(int left = i-2,right = 0;right < left;){
                    while(right < left && bigger[left] == 0){
                        left--;
                    }
                    while(right < left && bigger[right] == 1){
                        right++;
                    }
                    bigger.flip(left);
                    bigger.flip(right);
                }
                b = (int)bigger.to_ulong();
                break;
            }
        }
        return {b,s};
    }
};

暴力解

class Solution{
public:
    vector<int>findClosedNumbers(int num){
        if(num == 1)return{2,-1};//边界
        if(num == 2147483647)return{-1,-1};//边界
        int low = num,high = num,t = bitset<32>(num).count();//记录num中有多少个1
        vector<int>ans;//记录结果
        while(high++){
            if(bitset<32>(high).count() == t){//比num大，1个数相同的high
                ans.push_back(high);
                break;
            }
        }
        while(low--){//比num小，1个数相同的low
            if(bitset<32>(low).count() == t){
                ans.push_back(low);
                break;
            }
        }
        return ans;
    }
};