首页 > 其他 > 详细

Divide Two Integers

时间:2014-11-20 11:43:35      阅读:253      评论:0      收藏:0      [点我收藏+]

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

代码:

class Solution {
private:
    int res;
public:
    int solve(long long dividend, long long divisor){
        long long temp=1;
        while (divisor<=dividend)
        {
            divisor=divisor<<1;
            temp=temp<<1;
        }
        divisor=divisor>>1;
        temp=temp>>1;
        res+=temp;

        return dividend-divisor;

    }
    int divide(int dividend, int divisor) {
        res=0;
        bool fu=false;
        if(divisor==0) return -1;
        if(divisor==1) return dividend;

        long long my_dividend=(long long)dividend;
        long long my_divisor=(long long)divisor;
        if(my_dividend<0&&my_divisor<0){
            my_dividend=0-my_dividend;
            my_divisor=0-my_divisor;
            fu=false;
        }
        if(my_dividend<0) {my_dividend=-my_dividend;fu=true;}
        if(my_divisor<0) {my_divisor=-my_divisor;fu=true;}

        while (((my_dividend=solve(my_dividend,my_divisor))-my_divisor)>=0);

        if(fu) res=-res;
        return res;
    }
};
int main()
{
    freopen("C:\\Users\\Administrator\\Desktop\\a.txt","r",stdin);
    Solution so;
    int a=0-2147483648;
    int b=0-1017100424;
    cout<<so.divide(a,b)<<endl;
    return 0;
}

 

Divide Two Integers

原文:http://www.cnblogs.com/fightformylife/p/4110050.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!