https://leetcode.com/problems/divide-two-integers/
问题描述:
Medium
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.
Solution
class Solution {
public:
int divide(int dividend, int divisor) {
long long ldividend = abs((long long) dividend);
long long ldivisor = abs((long long) divisor);
int sign = ((long long)dividend*divisor < 0ll) ? -1 : 1;
long long q = 0;
while(ldividend >= ldivisor)
{
int qb = 0;
while(ldivisor*(1 << (qb + 1)) <= ldividend)
{
++qb;
if(qb == 30)
break;
}
q += (1 << qb);
ldividend -= (ldivisor*(1 << qb));
}
return sign*q > INT_MAX ? INT_MAX : sign*q;
}
};