网址
题目
求两数相除的商,非常简单的题
Java
错误答案
- 刚开始就很简单的这样写了,但存在的问题是可能两数分别为-2147483648
和-1,得出来的值是超过 int 范围的(-2147483648~2147483647 也就是 − 2 31 -2^{31} −231~ 2 31 − 1 2^{31}-1 231−1 )
class Solution {
public int divide(int dividend, int divisor) {
int reminder = Math.abs(dividend);
int quotient = 0;
int sign = (dividend*divisor > 0)?1:-1;
while(reminder >= Math.abs(divisor)){
reminder -= Math.abs(divisor);
quotient++;
}
return quotient*sign;
}
}
修改后
class Solution {
public int divide(int dividend, int divisor) {
long reminder = dividend;
reminder = Math.abs(reminder);
long _divisor = divisor;
_divisor = Math.abs(_divisor);
long quotient = 0;
int sign = ((dividend > 0 && divisor > 0) || (dividend < 0 && divisor < 0))?1:-1;
while(reminder >= _divisor){
reminder -= _divisor;
quotient++;
}
if(quotient*sign>Integer.MAX_VALUE || quotient*sign<Integer.MIN_VALUE)
return Integer.MAX_VALUE;
else return (int)(quotient*sign);
}
}
- 上面的代码可以通过测试,但是 Runtime: 6261 ms 实在太慢,看看讨论区别人怎么做的吧~
借鉴他人的想法
- 之前写的答案巨慢无比就是因为 while 循环的次数是与最后结果的绝对值大小正相关的,如果这个值非常大,迭代的次数就多,自然而然很慢
- 一种思路就是成倍成倍的减,商成倍的加,如果触碰了瓶颈再慢慢减。
- 以下就是该思路的实现了,最终的执行时间只有33ms 快了几百倍呢!
class Solution {
public int divide(int dividend, int divisor) {
// overflow
if(divisor == 0 || (dividend==Integer.MIN_VALUE && divisor==-1))
return Integer.MAX_VALUE;
long _dividend = Math.abs((long)dividend);
long _divisor = Math.abs((long)divisor);
int sign = ((dividend > 0 && divisor > 0) || (dividend < 0 && divisor < 0))?1:-1;
// fast return
if(dividend == 0 || _dividend < _divisor)
return 0;
long quotient = _divide(_dividend,_divisor);
if(quotient*sign>Integer.MAX_VALUE || quotient*sign<Integer.MIN_VALUE)
return Integer.MAX_VALUE;
else return (int)(quotient*sign);
}
private long _divide(long _dividend, long _divisor){
if(_dividend < _divisor) return 0;
long sum = _divisor;
long multiple = 1;
while(2*sum <= _dividend){
sum *= 2;
multiple *= 2;
}
return multiple+_divide(_dividend-sum,_divisor);
}
}