【Leetcode】【DivideTwoIntegers】【两数相除】【C++】

class Solution {
public:
    long long  abs(int n)
    {
        long long n1=n;
        if(n1<0)
            n1=-1*n1;
        return n1;
    }
    int divide(int dividend, int divisor) {
        int res=0;

        int int_min=1<<31;
        int int_max=(int_min>>31) ^ int_min;

        long long divid = dividend;
        long long divis = divisor;

        bool resNeg = false;

        if((divid>0 && divis<0) || (divid<0 && divis>0))
            resNeg = true;
        divid = abs(divid);
        divis = abs(divis);

        if(divis==1 && (divid-1)==int_max && !resNeg)
        {
            //cout<<"uicio";
            res=int_max;
            return int_max;
        }

        long long cnt=0;
        cout<" "<endl;

        while(divis<=divid)
        {
            cnt=1;
            long long temp=divis;
            while(temp<=divid)
            {
                temp = temp<<1;
                cnt = cnt<<1;
            }
            cout<<(cnt>>1)<<endl;

            res += (cnt>>1);
            divid -= (temp>>1);
        }

        if(resNeg)
            return -1*res;
        return res;

    }
};