LeetCode | 29. Divide Two Integers

 

题目：

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 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: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 231 − 1 when the division result overflows.

 

代码：

class Solution {
public:
    int divide(int dividend, int divisor) {
        int MAX_INT = 2147483647, MIN_INT = -2147483648;
		if (divisor == 0 || (dividend == MIN_INT && divisor == -1))
			return MAX_INT;
		int res = 0, isNeg = 1;
		if ((divisor < 0 && dividend > 0) || (divisor > 0 && dividend < 0))
		{
			isNeg = -1;
		}
		long long en = llabs(dividend);
		long long so = llabs(divisor);
		while (en >= so)
		{
			long long tmpdiv = so, val = 1;
			while (en > (tmpdiv << 1))
			{
				tmpdiv <<= 1;
				val <<= 1;
			}
			en -= tmpdiv;
			res += val;
		}
		return res * isNeg;
    }
};