Divide Two Integers

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

dividend = divisor*2^0 + divisor*2^1 + ... + divisor*2^n + mod; (mod<divisor).

public class Solution {    public int divide(int dividend, int divisor) {// Start typing your Java solution below// DO NOT write main() functionif(dividend == 0 || divisor == 0)return 0;int sign = 1;if(dividend < 0)sign = -sign;if(divisor < 0)sign = -sign;long dd;long dr;if(dividend == Integer.MIN_VALUE)dd = (long)Integer.MAX_VALUE + 1;elsedd = Math.abs(dividend);if(divisor == Integer.MIN_VALUE)dr = (long)Integer.MAX_VALUE + 1;elsedr = Math.abs(divisor);long count = 1;long num = dr;while(num < dd){num <<= 1;count <<= 1;}int result = 0;while(num >= dr){while(dd >= num){dd -= num;result += count;}num >>= 1;count >>= 1;}if(sign < 0)return -result;elsereturn result;}}