LeetCode-029 Divide Two Integers

Description

Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.

Return the quotient after dividing dividend by divisor.

The integer division should truncate toward zero.

Example

Example 1:

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

Example 2:

Input: dividend = 7, divisor = -3
Output: -2

Note

Both dividend and divisor will be 32-bit signed integers.
The divisor will never be 0.
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [$-2^{31}$, $2^{31}-1$]. For the purpose of this problem, assume that your function returns$2^{31}-1$when the division result overflows.

Analyse

一道很有趣的题，它要求你不用乘法，除法，取模来完成除法操作。排除前面的的三种操作之后，我们只剩加减法跟移位运算了，按道理来说，除法是可以用减法来完成的，但是一次一次的减太浪费时间了，我们可以考虑通过引入移位运算来加速减法操作。若被除数大于除数左移k位且小于除数左移(k+1)位时，那么就减去除数左移k位的值，直到做到被除数小于除数为止。

Code

class Solution {
public:
    int divide(int dividend, int divisor) {
        long ans = 0;
        if ((dividend == INT_MIN && divisor == -1)) return INT_MAX;
        int sign = ((dividend < 0) ^ (divisor < 0)) ? -1 : 1;
        long a = labs(dividend);
        long b = labs(divisor);
        while (a >= b) {
            long temp = b,base = 1;
            while (a >= (temp << 1)) {
                temp <<= 1;
                base <<= 1;
            }
            a -= temp;
            ans += base;
        }
        return sign * ans;
    }
};