Divide Two Integers

最新推荐文章于 2019-11-06 15:25:17 发布

chenofzju

最新推荐文章于 2019-11-06 15:25:17 发布

阅读量233

点赞数

分类专栏： LeetCode 文章标签： Math Binary Search

本文链接：https://blog.csdn.net/u011475681/article/details/44514369

版权

LeetCode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

Divide two integers without using multiplication, division and mod operator.

If it is overflow, return MAX_INT.

Solution:

class Solution {
private:
    static const int MAX_INT = 0x7fffffff;
    static const int MIN_INT = 0x80000000;
public:
    int divide(int dividend, int divisor) {
        if(!divisor) return MAX_INT;
        if(divisor == MIN_INT)
        {
            if(dividend == MIN_INT) return 1;
            else return 0;
        }
        int flag1 = 1, flag2 = 1, res = 0;
        if(dividend == MIN_INT)
        {
            if(divisor == -1) return MAX_INT;
            if(divisor == 1) return MIN_INT;
            if(divisor > 0) dividend += divisor;
            else dividend -= divisor;
            res += 1;
        }
        if(dividend < 0)
        {
            dividend = 0 - dividend;
            flag1 = -1;
        }
        if(divisor < 0)
        {
            divisor = 0 - divisor;
            flag2 = -1;
        }
        int top = 0;
        while(divisor << top > 0 && divisor << top <= dividend) top++;
        for(int i = --top; i >= 0; --i)
        {
            if(dividend >= divisor << i)
            {
                res += 1 << i;
                dividend -= divisor << i;
            }
        }

        return (flag1 == flag2) ? res : 0 - res;
    }
};