Divide Two Integers leetcode java

题目：

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

public int divide(int dividend, int divisor) { 
        if (dividend == 0 || divisor == 0) { 
            return 0; 
        } 
        boolean isNeg = (dividend > 0 && divisor < 0) 
                || (dividend < 0 && divisor > 0); 
        long a = Math.abs((long) dividend); 
        long b = Math.abs((long) divisor); 
        if (b > a) { 
            return 0; 
        } 
   
        long sum = 0; 
        long pow = 0; 
        long result = 0; 
        while (a >= b) { 
            pow = 1; 
            sum = b; 
            while (sum + sum <= a) { 
                sum += sum; 
                pow += pow; 
            } 
            a -= sum; 
            result += pow; 
        }
 
        result = ((((dividend ^ divisor) >> 31) & 1) == 1) ? -result: result;
          
         if (result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) {
            return Integer.MAX_VALUE;
         }
          
         return (int)result;
    }