码迷,mamicode.com
首页 > 其他好文 > 详细

每日算法之二十五:Divide Two Integers

时间:2014-06-01 18:16:23      阅读:311      评论:0      收藏:0      [点我收藏+]

标签:c   style   class   blog   code   a   

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

不使用乘法、除法和求模运算求两个数相除。

class Solution {
public:
    long long internalDivide(unsigned long long dividend,unsigned long long divisor)
    {
      if(dividend<divisor)
        return 0;
      int result = 1;
      unsigned long long temp = divisor,left;
      while(temp<=dividend)
      {
        left = dividend - temp;
        temp<<=1;
        if(temp>dividend)
          break;
        else
          result<<=1;
      }
      return result + internalDivide(left,divisor);
    }
    int divide(int dividend, int divisor) {
      unsigned long long _dividend = abs(static_cast<long long>(dividend)),
                         _division = abs(static_cast<long long>(divisor));  
      bool flag = ((dividend<=0)&&(divisor>0))|| ((dividend>=0)&&(divisor<0));
      return flag?(-1)*internalDivide(_dividend,_division):internalDivide(_dividend,_division);
    }
};


简要分析,以87/4为例:4小于87,4左移一位变成8,计数左移一位变成2。8小于87,继续左移变成16,计数变成4.16小于87左移变成32,计数变成8。32小于87左移变成64,计数变成16。继续左移变成128大于87。87减去64 = 23。计数为16倍。用23继续上述步骤,知道


每日算法之二十五:Divide Two Integers,布布扣,bubuko.com

每日算法之二十五:Divide Two Integers

标签:c   style   class   blog   code   a   

原文地址:http://blog.csdn.net/yapian8/article/details/27962017

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!