Divide Two Integers

Divide two integers without using multiplication, division and mod operator.

If it is overflow, return MAX_INT.

Solution:

  1. public class Solution {
  2.   public int divide(int dividend, int divisor) {
  3.     if (dividend == Integer.MIN_VALUE && divisor == -1) {
  4.       return Integer.MAX_VALUE;
  5.     }
  7.     long p = Math.abs((long)dividend);
  8.     long q = Math.abs((long)divisor);
  10.     int res = 0;
  12.     while (p >= q) {
  13.       int count = 0;
  14.       while (p >= (q << count)) {
  15.         count++;
  16.       }
  18.       p -= q << (count - 1);
  19.       res += 1 << (count - 1);
  20.     }
  22.     return ((dividend^divisor) >>> 31 == 0) ? res : -res;
  23.   }
  24. }