Divide two integers without using multiplication, division and mod operator.
class Solution {
public:
int divide(int dividend, int divisor) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
assert(divisor);
int ans = 0, step = 1, negative = 0,result = 0;
if (divisor == 1) return dividend;
if (divisor == -1) return -dividend;
if (dividend == 0) return 0;
if ((dividend < 0 && divisor > 0) || (dividend > 0 && divisor < 0)) negative = 1;
if (negative || (dividend < 0 && divisor < 0)) {
dividend = abs(dividend);
divisor = abs(divisor);
}
int i = 0;
while(true){
if (result + step * divisor > dividend){
step >> 1;
}
for(int m = 0; m < step; m++){
result += divisor;
}
ans += step;
step << 1;
i++;
}
while(result + divisor < dividend){
ans++;
result += divisor;
}
return negative ? -ans : ans;
}
};
原文链接: https://www.cnblogs.com/kwill/p/3189244.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/95812
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!