力扣剑指offer2第1天整数

1）剑指 Offer II 001. 整数除法

class Solution{
public:
    int divide(int a, int b){
        if(a==INT_MIN && b==-1) return INT_MAX;
        int flag = (a>0)^(b>0) ? -1 : 1;
        unsigned int ua = abs(a);
        unsigned int ub = abs(b);
        unsigned int res = 0;
        for(int i=31; i>=0; i--){
            if((ua>>i) >= ub){
                ua -= ub<<i;
                res += 1<<i;
            }
        }
        return flag==1 ? res : -res;
    }
};
    

2)剑指 Offer II 002. 二进制加法

class Solution{
public:
    string addBinary(string a, string b){
        string res = "";
        reverse(a.begin(), a.end());
        reverse(b.begin(), b.end());
        int n = max(a.size(), b.size());
        int carry = 0;
        for(int i=0; i<n; i++){
            carry += i<a.size() ? a[i]=='1' : 0;
            carry += i<b.size() ? b[i]=='1' : 0;
            res.push_back((carry%2) ? '1' : '0');
            carry = carry/2;
        }
        if(carry) res.push_back('1');
        reverse(res.begin(), res.end());
        return res;
    }
};

3)前 n 个数字二进制中 1 的个数

class Solution{
public:
    vector<int> countBits(int n){
        vector<int> bits(n+1);
        for(int i=1; i<=n; i++){
            bits[i] = bits[i&(i-1)] + 1;
        }
        return bits;
    }
};