Divide Two Integers

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

If it is overflow, return MAX_INT.

Runtime: 8ms

class Solution {
public:
    int divide(int dividend, int divisor) {
    if(divisor == 0) return INT_MAX;
    
    long long newDividend = dividend;
    if(newDividend < 0) newDividend = -newDividend;
    long long newDivisor = divisor;
    if(newDivisor < 0) newDivisor = -newDivisor;
    
    bool negative = ((dividend < 0 && divisor > 0 )|| (dividend > 0 && divisor < 0));
    long long divis = newDivisor;

    long long result = 0;
    while(divis <= newDividend){
        long long times = 1;
        
        while(divis <= newDividend){
            divis <<= 1;
            times <<= 1;
        }
        newDividend -= (divis >> 1);
        divis = newDivisor;
        result += (times >> 1);
    }
    if(result > INT_MAX){
        if(negative && result + INT_MIN <= 0)
            result = result;
        else
            result = INT_MAX;
    }
    return negative ? -result : result;
}
};