-
Notifications
You must be signed in to change notification settings - Fork 0
/
dividetwoint.cpp
74 lines (58 loc) · 1.58 KB
/
dividetwoint.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
class Solution {
public:
int mark[11];
int left[11];
int divide(int dividend, int divisor) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int sign = 0;
int flag = 0;
if(dividend < 0 && divisor > 0){
dividend = -dividend;
sign = 1;
}
if(dividend > 0 && divisor < 0){
divisor = -divisor;
sign = 1;
}
if(dividend < 0 && divisor < 0){
dividend = -dividend;
divisor = -divisor;
}
if(dividend < 0){
dividend = INT_MAX;
flag = 1;
if(divisor < 0){
return 1;
}
}
if(divisor < 0){
return 0;
}
mark[0] = divisor;
left[0] = 1;
int i;
int quot = 0,count = dividend;
for(i = 1; i <= 10; i ++){
mark[i] = mark[i-1]+mark[i-1];
left[i] = left[i-1]+left[i-1];
if(mark[i] < 0)
break;
}
i--;
for(; i >= 0; i --){
while(count >= mark[i]){
count-=mark[i];
quot+= left[i];
if(flag == 1){
count++;
flag = 0;
}
}
}
if(sign == 1)
return -quot;
else
return quot;
}
};