LeetCode Divide Two Integers

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

If it is overflow, return MAX_INT.

public class Solution {
    public int divide(int dividend, int divisor) {
        if (dividend == 0) {
            return 0;
        }

        long a=dividend,b=divisor;
        boolean isNeg=false;
        if (dividend < 0) {
            isNeg=!isNeg;
            a=-a;
        }
        if (divisor < 0) {
            isNeg = !isNeg;
            b = -b;
        }
        long i=0;
        if(b==1) {
           i=a; 
        }else
        {
            while (a >= b) {
                long temp = b;
                int k=1;
                while (temp + temp <= a) {
                    k = k << 1;
                    temp = temp + temp;
                }
                i = i | k;
                a = a - temp;
            }            
        }

        if (isNeg) {
            i = -i;
        }
        if (i > Integer.MAX_VALUE || i < Integer.MIN_VALUE) {
            return Integer.MAX_VALUE;
        }        
        return (int)i;
    }
}