Divide Two Integers

john_and_betty

于 2014-03-25 19:04:18 发布

阅读量394

点赞数

分类专栏： leetcode。。。不会

本文链接：https://blog.csdn.net/asasopo/article/details/22088647

版权

leetcode。。。不会专栏收录该内容

31 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int divide(int dividend, int divisor) {
        if(dividend==0)
            return 0;
        int tag=0;
        if(dividend>0&&divisor<0||dividend<0&&divisor>0)
            tag=1;
        long long dividend1=dividend;
		long long divisor1=divisor;
        dividend1=abs(dividend1);
        divisor1=abs(divisor1);
        int res=0,final=0;
        while(dividend1>=divisor1)
        {
            res=1;
            long long sum=divisor1;
            while(sum+sum<=dividend1)
            {
                res=res+res;
                sum=sum+sum;
            }
            dividend1=dividend1-sum;
            final=final+res;
        }
        if(tag==1)
           return -final;
        return final;
    }
};