Leetcode 29. 两数相除

利用移位和减法做
首先被除数-除数的2^t倍【使被除数符号不发生变化的最高t】，把2^t保存
然后新的被除数-……
为防止溢出，都用负数进行运算

class Solution {
public:
    const int M = 0x7fffffff, m = 0x80000000;
    int divide(int dividend, int divisor) {
        if (dividend == m && divisor == -1) return M;
        int f = 0, ans = 0, T = divisor, t;
        if (dividend > 0) dividend = -dividend, f ^= 1;
        if (divisor > 0) divisor = -divisor, f ^= 1;
        while (divisor >= dividend) {
            t = -1, T = divisor;
            while ((T << 1)<0 && (T << 1) >= dividend) T <<= 1, t <<= 1;
            if (f) ans += t;
            else ans -= t;
            dividend -= T;
        }
        return ans;
    }
};