您的位置:首页 > 其它

LeetCode-Divide Two Integers

2014-08-17 17:29 323 查看
Divide two integers without using multiplication, division and mod operator.

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
int divide(int dividend, int divisor) {
long long dd = abs((double)dividend);
long long dr = abs((double)divisor);
int result = 0;
while (dd >= dr) {
long long temp = dr;
for (int i = 0; dd >= temp<<i; ++i) {
dd -= temp<<i;
result += 1<<i;
}
}
if ((dividend > 0 && divisor > 0) || (dividend < 0 && divisor < 0)) return result;
else return -result;
}
};</span>
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息