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.

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.

题目链接：

---

思路分析

给两int，dividend 和divisor，不实用除法乘法和模除，返回两个数的除的结果。

对与分母为0或者为INT_MIN的情况，直接返回INT_MAX。然后对于剩下的计算，分为两部分处理：首先计算符号为，两个数异或的结果即可，为真则是负数；然后使用位操作，进行除法计算，就像最基础的除法算式一样，multiple就是计算出的结果，累加起来就可以了。

代码

class Solution {
public:
int divide(int dividend, int divisor) {
if (divisor == 0 || (dividend == INT_MIN && divisor == -1))
return INT_MAX;
int sign = ((dividend > 0) ^ (divisor > 0))? -1: 1;
long long dvd = labs(dividend);
long long dvs = labs(divisor);
int res = 0;
while (dvd >= dvs){
long long temp = dvs, multiple = 1;
while (dvd >= (temp << 1)){
temp <<= 1;
multiple <<= 1;
}
dvd -= temp;
res += multiple;
}
return sign == 1 ? res: -res;
}
};
“`
时间复杂度：$未知$
空间复杂度：$未知$

---

反思

使用long long防止越界的出现。位操作就类似于十进制中的每次乘10，在这种情况下就是乘2而已，还是一样的计算的。