题目:
Divide two integers without using multiplication, division and mod operator.
解法:
一度以为使用减法不停循环就可以得出结果,结果对于MAX_INT/1这种情况,分分钟TLE啊~~~~
第二种思路是想模仿计算机计算除法时的方法,即二进制除法,对dividend取高位除以divisor,得余数后继续循环移位接着除,但是想了想,这种代码太繁琐,而且关键是java没有循环移位啊QAQ。
第三种思路就是二分法加递归,如果dividend>2倍的divisor,就将divisor一直2倍2倍的增加下去,如果dividend<2倍的divisor,就在被除数的基础上减去除数,然后递归新的结果,并加上刚刚获得商。
public class No28_DivideTwoIntegers {
final static int MAX_INT = 2147483647;
final static int MIN_INT = -2147483648;
public static void main(String[] args){
System.out.println(divide(-2147483648, 1));//2^30+1
}
public static int divide(int dividend, int divisor) {
//Divide two integers without using multiplication, division and mod operator.
if(divisor == 0) return 0xFFFFFFFF;
int sign = 1;
if(dividend <= 0 && divisor > 0){
sign = -1;
divisor = 0 - divisor;
}
else if(dividend > 0 && divisor < 0){
sign = -1;
dividend = 0 - dividend;
}
else if(dividend > 0 && divisor > 0){
dividend = 0 - dividend;
divisor = 0 - divisor;
}
return sign>0?dNegative(dividend, divisor):0-dNegative(dividend, divisor);
}
public static int dNegative(int dividend, int divisor){
if(dividend > divisor) return 0;
int ret = 1;
int tmp = divisor;
while(tmp >= -1073741824 && dividend < (tmp+tmp)){
tmp += tmp;
ret += ret;
}
return ret+dNegative(dividend-tmp, divisor);
}
}