首页 > 其他 > 详细

leetcode:Divide Two Integers

时间:2015-04-03 23:55:28      阅读:391      评论:0      收藏:0      [点我收藏+]
class Solution {
public:
    int divide(int dividend, int divisor) {
        long long div = dividend,dis = divisor;
        div = abs(div);
        dis = abs(dis);
        long long res = 0;
        while(div>=dis)
        {
            long long temp = dis;
            int i = 0;
            while(div>=temp)
            {
                temp = temp<<1;
                i++;
            }
            res += ((long long)1<<(i-1));
            div -= (dis<<(i-1));
        }
        res = ((long long)dividend>0^(long long)divisor>0)?-res:res;
        if(res>((1<<31)-1))
            return (1<<31)-1;
        return res;
    }
};

leetcode:Divide Two Integers

原文:http://blog.csdn.net/majing19921103/article/details/44862875

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