1、有数字判断时,先看这个数字是正是负;
2、注意最大范围2147483647,和-2147483648的判断;
3、这个题是要背住的;
题目:
Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT.
思路:
1、分成两次循环进行,背住;
代码:
class Solution {
public:
int divide(int dividend, int divisor) {
long long a=dividend<0?-(long long)dividend:dividend;
long long b=divisor<0? -(long long)divisor :divisor;
if((dividend==-2147483648) &&(divisor==-1)) return 2147483647;
long long result=0;
while(a>=b)
{
long long c=b;
for(int i=0;a>=c;++i,c<<=1)
{
a=a-c;
result+=1<<i;
}
}
return ((dividend^divisor)>>31)?(-result):(result);
}
};