LeetCode 29. Divide Two Integers

---

Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.Return the quotient after dividing dividend by divisor.The integer division should truncate toward zero.

Example 1:

Input: dividend = 10, divisor = 3
Output: 3

Example 2:

Input: dividend = 7, divisor = -3
Output: -2

Note:

• Both dividend and divisor will be 32-bit signed integers.
• The divisor will never be 0.
• Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−2^31,  2^31 − 1]. For the purpose of this problem, assume that your function returns 2^31 − 1 when the division result overflows.

---

解法一：

基于问题的要求出发，不让使用乘法、除法和模操作。我们就转化问题的形式，利用别的操作符来求解。这种方法有取巧的嫌疑。

除法转化公式： 

 /** a/b = e^(ln(a))/e^(ln(b)) = e^(ln(a)-ln(b)) **/

基础语法知识： 

abs( )主要用于对求整数的绝对值，在“stdlib.h”(或 <cstdlib>)头文件里面

fabs( )主要是求精度要求更高的double ，float 型的绝对值，在<cmath>头文件里。两者在只#include<cmath>时都可以使用。

class Solution {
    public:
        int divide(int dividend, int divisor) {
            /** a/b = e^(ln(a))/e^(ln(b)) = e^(ln(a)-ln(b)) **/
            if(dividend==0)  return 0;
            if(divisor==0)  return INT_MAX;
            
            double t1=log(fabs(dividend));
            double t2=log(fabs(divisor));
            long long result=double(exp(t1-t2));
            if((dividend<0) ^ (divisor<0))  result=-result;
            if(result>INT_MAX)  result=INT_MAX;
            return result;
        }
    };

解法二：

 C++ bit manipulations（位操作）

C\C++ 中的绝对值函数：abs()、cabs()、fabs()、labs()

1.  int abs(int i) //返回整型参数i的绝对值
2. double cabs(struct complex znum) //返回复数znum的绝对值
3. double fabs(double x) //返回双精度参数x的绝对值
4. long labs(long n) //返回长整型参数n的绝对值

class Solution {
public:
    int divide(int dividend, int divisor) {
        if (dividend == INT_MIN && divisor == -1) {
            return INT_MAX;
        }
        long dvd = labs(dividend), dvs = labs(divisor), ans = 0;
        int sign = dividend > 0 ^ divisor > 0 ? -1 : 1;
        while (dvd >= dvs) {
            long temp = dvs, m = 1;
            while (temp << 1 <= dvd) {
                temp <<= 1;
                m <<= 1;
            }
            dvd -= temp;
            ans += m;
        }
        return sign * ans;
    }
};