LeetCode-Divide Two Integers

最新推荐文章于 2019-11-30 11:08:51 发布

所难

最新推荐文章于 2019-11-30 11:08:51 发布

阅读量374

点赞数

分类专栏： Cracking LeetCode Math Game 文章标签： leetcode Divide Two Integers

本文链接：https://blog.csdn.net/HolyDominat/article/details/38640625

版权

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章 0 订阅

订阅专栏

Math Game

50 篇文章 0 订阅

订阅专栏

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>