-
Notifications
You must be signed in to change notification settings - Fork 52
/
Copy pathDivide Two Integers.cpp
85 lines (76 loc) · 2.14 KB
/
Divide Two Integers.cpp
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/*
* Solution 1:
* Use long type
*/
class Solution {
public:
int divide(int dividend, int divisor) {
if (dividend == INT_MIN && divisor == -1) {
return INT_MAX;
}
bool positive = true;
if ((dividend > 0 && divisor < 0) || (dividend < 0 && divisor > 0)) {
positive = false;
}
long new_dividend = abs((long)dividend);
long new_divisor = abs((long)divisor);
long result = 0;
int power = 0;
while (new_divisor <= (new_dividend >> 1)) {
new_divisor = new_divisor << 1;
power++;
}
while (power >= 0) {
if (new_dividend >= new_divisor) {
result += (1 << power);
new_dividend -= new_divisor;
}
power--;
new_divisor = new_divisor >> 1;
}
return positive ? result : -result;
}
};
/*
* Solution 2:
* Don't use long type
*/
class Solution {
public:
int divide(int dividend, int divisor) {
if (dividend == INT_MIN) {
if (divisor == -1) {
return INT_MAX;
}
if (divisor > 0) {
return -1 + divide(dividend + divisor, divisor);
} else {
return 1 + divide(dividend - divisor, divisor);
}
}
if (divisor == INT_MIN) {
return dividend == INT_MIN ? 1 : 0;
}
bool positive = true;
if ((dividend > 0 && divisor < 0) || (dividend < 0 && divisor > 0)) {
positive = false;
}
int new_dividend = abs(dividend);
int new_divisor = abs(divisor);
int result = 0;
int power = 0;
while (new_divisor <= (new_dividend >> 1)) {
new_divisor = new_divisor << 1;
power++;
}
while (power >= 0) {
if (new_dividend >= new_divisor) {
result += (1 << power);
new_dividend -= new_divisor;
}
power--;
new_divisor = new_divisor >> 1;
}
return positive ? result : -result;
}
};