leetcode/Problems/0029.cpp at master · DimitrijeDobrota/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
class Solution {
  public:
    int divide(int dividend, int divisor) {
        if (divisor == INT_MIN) return dividend == INT_MIN;
        if (divisor == INT_MAX) {
            if (dividend == INT_MIN) return -1;
            if (dividend == INT_MAX) return 1;
            return 0;
        }

        if (divisor == 1) return dividend;
        if (divisor == -1) {
            if (dividend == INT_MIN) return INT_MAX;
            return -dividend;
        }

        int res = 0, sign = 1;
        if (divisor < 0) divisor = -divisor, sign = -sign;
        if (dividend < 0) {
            if (dividend == INT_MIN) dividend += divisor, res++;
            dividend = -dividend, sign = -sign;
        }

        while (dividend >= divisor) {
            long temp = divisor, count = 1;
            while (temp << 1 <= dividend) {
                temp <<= 1;
                count <<= 1;
            }
            dividend -= temp;
            res += count;
        }
        return sign * res;
    }
};