leetcode 29. Divide Two Integers

int divide(int dividend, int divisor) {

if(dividend == INT32_MIN){
    if(divisor == 1)return INT32_MIN;
    if(divisor == -1) return INT32_MAX;
}
if(divisor == 0){
    if(dividend > 0)return INT32_MAX;
    if(dividend < 0)return INT32_MIN;
    else return 0;
}
long dividend_l = dividend;
long divisor_l = divisor;
int sign = ((dividend_l<0)^(divisor_l<0))?-1:1;
dividend_l = abs(dividend_l);
divisor_l = abs(divisor_l);
long ret = 0;
while(dividend_l>=divisor_l){
    long q = 1 , tmp = divisor_l;
    while( dividend_l >= (tmp<<1) ){
        cout<<tmp<<endl;
        tmp  = tmp << 1;
        q = q << 1;
    }
    ret = ret + q;
    dividend_l = dividend_l - tmp;
}

}