leetcode divide two int

问题描述：

Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT.

https://oj.leetcode.com/problems/divide-two-integers/点击打开链接

问题分析：

实现整数除法操作：

1. 采用减法实现

2.减少迭代次数，逐次减法不可取, 使用lg(n)时间地迭代方案

3.处理溢出问题，结果符号问题

示例代码：

     /* 除数等于0怎么处理？？ */
    int divide(int dividend, int divisor) 
    {
        if (divisor == 1)
        {
            return dividend;
        }
        if (divisor == 0)
        { /* how to handle the problem */}
        int bits = 8 * sizeof(int);
        long long a , b, c;
        long long  ret = 0;
        a = (long long )dividend;
        b = (long long )divisor;
        if (a < 0) a = -a;
        if (b < 0) b = -b;
        while (a >= b) 
        {
            c = b;
            for (int i = 0; a >= c; i++, c <<= 1) /* lg(n) 时间的迭代 */
            {
                a -= c; ret += 1 << i;
            }
        }
        /* 符号数范围，负数能多表示一个 [-maxVal, maxVal - 1]*/
        int val =  ((dividend ^ divisor) >> (bits - 1) ) ? (-ret < INT_MIN ? INT_MIN : -ret) : (ret > INT_MAX ? INT_MAX : ret);
        return val;
    }

判断两个符号整数是否异号的方法： ((dividend ^ divisor) >> (bits - 1) ) ? negative ：positive
一个有符号整数如何快速的求其相反数：-ret