Dividing integers without using division, multiplication, mod operators

import java.lang.Math;
public class Solution {
    public int divide(int dividend, int divisor) {
        int count = 0;
        boolean isNegative = false;
        if(dividend == divisor){
            return 1;
        } else if(divisor == 1){
            return dividend;
        } else if(dividend < 0 && divisor < 0){
          isNegative = false;
        } else if(dividend < 0 || divisor < 0){
            isNegative = true;
        } else if(dividend > Integer.MAX_VALUE){
            return Integer.MAX_VALUE;
        }
        if(dividend == Integer.MIN_VALUE && divisor == -1){
          return Integer.MAX_VALUE;
        }
        dividend = Math.abs(dividend);
        divisor = Math.abs(divisor);
            while(divisor <=dividend){
              dividend -= divisor;
              count++;
            }
        if(isNegative){
            count = count * -1;
        }
    return count;    
    }
}