Jan 15 - Divide Two Integers; Math; Integer; Bit Operation;

public class Solution {
    public int divide(int dividend, int divisor) {
        int result = 0;
        int flag = 0;
        if(divisor == 0 ||(divisor == -1 && dividend == Integer.MIN_VALUE)) return Integer.MAX_VALUE;
        if(dividend == 0) return 0;
        if(dividend < 0) flag++;
        if(divisor < 0) flag++;
        long divn = (long) (Math.abs((long) dividend));
        long divs = (long) (Math.abs((long) divisor));
        
        while(divs <= divn){
            long temp = divs;
            long x = 1;
            while((temp<<1) < divn){
                x <<= 1;
                temp <<= 1;
            }
            result += x;
            divn -= temp;
        }
        return flag == 1? (0-result) : result;
    }
}