LeetCode--29. Divide Two Integers

最新推荐文章于 2020-06-12 21:55:45 发布

To_be_thinking

最新推荐文章于 2020-06-12 21:55:45 发布

阅读量149

点赞数

分类专栏： leetcode与剑指Offer

本文链接：https://blog.csdn.net/to_be_to_thought/article/details/89527967

版权

leetcode与剑指Offer 专栏收录该内容

222 篇文章 0 订阅

订阅专栏

29. Divide Two Integers

#include <cmath>

class Solution {
public:
    int divide(int dividend, int divisor) {
        if(dividend==0)
            return 0;
        long divid=dividend,divis=divisor;
        long result=divideLong(abs(divid),abs(divis));
        result=divid*divis<0?-result:result;
        if(result>INT_MAX || result<INT_MIN) return INT_MAX;
        return (int)result;
        
    }
    
    long divideLong(long dividend,long divisor)
    {
        if(dividend<divisor)
            return 0;
        long sum=divisor,divideTimes=1;
        while(sum+sum<=dividend)
        {
            sum+=sum;
            divideTimes+=divideTimes;
        }
        return divideTimes+divideLong(dividend-sum,divisor);
    }
};