,Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT.
思路:看到这到题第一想法是用dividend每次减一个divisor,直到dividend小于divisor,减的次数即为所求的解,显然当dividend比较大而divisor比较小时,比较耗时,而且测试也通不过;为了减少减法的次数可以以2的指数步长来进行(之前的步长为1,此时的步长为2的指数次方,类似于跳表法),比如dividend=100,divisor=3;若步长为1的话,则需要进行减法的次数为34次(3,2×3,3×3,。。。33×3,34×3),若以2的指数为步长,则只需要进行9次(3,3×2,3×2×2,3×2×2×2,3×2×2×2×2,3×2×2×2×2×2=96,3×2×2×2×2×2×2,然后与100-96=4重复相似的步骤(3,3×2)),具体选择以2的指数为步长是为了使用位操作,本题要求溢出的话返回MAX_INT,需要特别注意,代码如下:
class Solution {
public:
int divide(int dividend, int divisor){
if(divisor == 0)
exit(1);
if(dividend == -2147483648 && divisor == -1)
return 2147483647;
int flag = 1;//正负号
if((divisor > 0 && dividend < 0) || (divisor < 0 && dividend > 0))
flag = -1;
//全部转换为正数处理
unsigned int divid = dividend, divis = divisor;
if(divisor < 0)
divis = -divis;
if(dividend < 0)
divid = -divid;
unsigned int ret = 0, k, c;
while(divid >= divis){
for(k = 0, c = divis; divid >= c; c<<=1, k++){
if(divid - c < divis){
ret += 1<<k;
return flag*ret;
}
}
ret += 1<<(k-1);
divid -= c>>1;
}
return flag*ret;
}
};