Leetcode-Divide Two Integers

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

If it is overflow, return MAX_INT.

Solution:

public class Solution {
    public int divide(int dividend, int divisor) {
        if (divisor==0) return Integer.MAX_VALUE;
        if (dividend==0) return 0;
        if (divisor==1) return dividend;
        if (dividend==Integer.MIN_VALUE && divisor==-1) return Integer.MAX_VALUE;

        boolean neg = false;
        //change to all negtive number.
        if (dividend>0){
            dividend = -dividend;
            neg = !neg;
        }
        if (divisor>0){
            divisor = - divisor;
            neg = !neg;
        }

        int minDivisor = Integer.MIN_VALUE >> 1;
        int cur = divisor;
        int val = 1;
        while (cur>=minDivisor && cur>dividend){
            cur <<= 1;
            val <<= 1;
        }

        int res = 0;
        while (dividend<=divisor){
            while (cur<dividend){
                cur >>= 1;
                val >>= 1;
            }
            dividend -= cur;
            res += val;
        }

        if (neg) return -res;
        else return res;
    }
}