【Leetcode】29. 两数相除（Divide Two Integers）

Leetcode - 29 Divide Two Integers (Medium)

题目描述：不使用乘法、除法和 mod 运算符。

Input: dividend = 10, divisor = 3
Output: 3

解题思路：注意整数溢出的情况， 可以利用二分的思想优化求解。

public int divide(int dividend, int divisor) {
    int sign = 1;
    if ((dividend > 0 && divisor < 0) || (dividend < 0 && divisor > 0))
        sign = -1;
    long ldividend = Math.abs((long) dividend);
    long ldivisor = Math.abs((long) divisor);

    if (ldivisor == 0) return Integer.MAX_VALUE;
    if ((ldividend == 0) || (ldividend < ldivisor))	return 0;

    long lans = ldivide(ldividend, ldivisor);

    int ans;
    if (lans > Integer.MAX_VALUE){
        ans = (sign == 1)? Integer.MAX_VALUE : Integer.MIN_VALUE;
    } else {
        ans = (int) (sign * lans);
    }
    return ans;
}

private long ldivide(long ldividend, long ldivisor) {
    if (ldividend < ldivisor) return 0;
    long sum = ldivisor;
    long multiple = 1;
    while ((sum + sum) <= ldividend) {
        sum += sum;
        multiple += multiple;
    }
    return multiple + ldivide(ldividend - sum, ldivisor);
}