原题:Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT.
计算两数相除的商;
思路:将被除数dividend表示为除数的多项式:dividend = 2^i * divisor + 2^(i-1) * divisor + ... + 2^0 * divisor;所求的商即为各个位置系数的和;而求系数可以通过左移完成;
一开始没有想到,后参考文章:http://www.bubuko.com/infodetail-809508.html
中间变量最好采用long类型,之后要考虑溢出;
我采用了双重循环,也可将外层循环用递归完成;
代码:
public class Solution {
public int divide(int dividend, int divisor) {
if(divisor==0){
return Integer.MAX_VALUE;
}
boolean flag=((dividend>0 && divisor>0) || (dividend<0 && divisor<0));
long res=0;
long temp;
long absend=Math.abs((long)dividend);
long absor=Math.abs((long)divisor);
long tempsor=absor;
while(absend>=absor){
temp=1;
while(absend>=(tempsor<<1)){
temp<<=1;
tempsor<<=1;
}
res+=temp;
absend-=tempsor;
tempsor=absor;
}
res=flag==true?res:-1*res;
if(res>=Integer.MAX_VALUE){
return Integer.MAX_VALUE;
}
if(res<=Integer.MIN_VALUE){
return Integer.MIN_VALUE;
}
return (int)res;
}
}