Description:
Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT.
Note:
None
Solution:
Analysis and Thinking:
题目要求在不使用乘法、除法的情况下,实现两个整数的除法。第一反应就是利用移位操作。
Steps:
1.判断除数是否为0,如果是,返回无穷大值
2.定义flag值,并依据除数被除数的正负符号,改变flag的符号
3.取得除数、被除数的绝对值,以进行移位操作
4.将除数不断左移,然后不断从被除数中除去移位部分
5.当除数移位到比被除数小时,结束循环,返回结果
Codes:
class Solution {
public:
int divide(int dividend, int divisor) {
if(divisor==0){
return INT_MAX;
}
if(dividend==INT_MIN &&divisor==-1) return INT_MAX;
int flag=1;
if(divisor<0) flag=-flag;
if(dividend<0) flag=-flag;
unsigned long b=abs((long)divisor);
unsigned long a=abs((long)dividend);
int result=0;
while(a>=b){
long temp=0;
int i;
for(i=0;temp<=a;i++)
{
temp=b<<i;
}
result=0x1<<(i-2)+result;
temp=temp>>1;
a=a-temp;
}
return result*flag;
}
};
Results: