// 32 ~ 3*10 = 3*[1*(2^3) + 0*(2^2) + 1*(2^1) + 0*(2^0)]

public int divide(int dividend, int divisor) {

if (divisor == 0) {

return dividend >= 0? Integer.MAX_VALUE : Integer.MIN_VALUE;

}

if (dividend == 0) {

return 0;

}

if (dividend == Integer.MIN_VALUE && divisor == -1) {

return Integer.MAX_VALUE;

}

boolean isNegative = (dividend < 0 && divisor > 0) ||

(dividend > 0 && divisor < 0);

// Need to be long since b << shift may be overflow

long a = Math.abs((long)dividend);

long b = Math.abs((long)divisor);

int result = 0;

while(a >= b){

int shift = 0;

while(a >= (b << shift)){

shift++;

}

a -= b << (shift - 1);

result += 1 << (shift - 1);

}

return isNegative? -result: result;

}

}