您的位置:首页 > 其它

leetcode:Divide Two Integers

2015-04-03 23:38 405 查看
class Solution {
public:
int divide(int dividend, int divisor) {
long long div = dividend,dis = divisor;
div = abs(div);
dis = abs(dis);
long long res = 0;
while(div>=dis)
{
long long temp = dis;
int i = 0;
while(div>=temp)
{
temp = temp<<1;
i++;
}
res += ((long long)1<<(i-1));
div -= (dis<<(i-1));
}
res = ((long long)dividend>0^(long long)divisor>0)?-res:res;
if(res>((1<<31)-1))
return (1<<31)-1;
return res;
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: