题目描述:
Divide two integers without using multiplication, division and mod operator.
思路解析:
- 判空,返回0
- 使用long类型的变量存储division和divisor的绝对值
- 如果除数小于被除数,返回0
- 使用加法完成除法,注意保存加了多少倍,使用嵌套循环,外层控制division大于divisor,里层控制倍数增加一倍是否比division要小
- 最后返回值的时候不要忘记注意正负号
代码:
public class Solution {
public int divide(int dividend, int divisor) {
if(dividend==0 || divisor == 0)
return 0;
boolean flag = (dividend<0 && divisor>0)||(dividend>0 && divisor<0);
long a = Math.abs((long)dividend);//注意要转换成long型
long b = Math.abs((long)divisor);
int result = 0;
if(a<b)
return 0;
long sum=0;
long pow=0;
while(a>=b){
sum = b;
pow = 1;
while(sum+sum<=a){
sum+=sum;
pow+=pow;
}
a-=sum;
result+=pow;
}
return flag==true?-result:result;
}
}