-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathN029DivideTwoInt.go
More file actions
119 lines (111 loc) · 2.27 KB
/
N029DivideTwoInt.go
File metadata and controls
119 lines (111 loc) · 2.27 KB
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
package main
type N029DivideTwoInt struct {
}
// Dividend and divisor should both >0 or both <0
func (this *N029DivideTwoInt) divideInternal(dividend int, divisor int, remainder *int) int {
if (dividend > 0 && divisor < 0) || (dividend < 0 && divisor > 0) {
*remainder = 0
return 0
}
i := 0
if dividend > 0 && divisor > 0 {
for dividend >= divisor {
dividend -= divisor
i++
}
} else {
for dividend <= divisor {
dividend -= divisor
i++
}
}
*remainder = dividend
return i
}
func (this *N029DivideTwoInt) divide(dividend int, divisor int) int {
BIG_NUMBER := 10000
if divisor == 0 {
return INT_MAX
}
if divisor == 1 {
return dividend
}
if divisor == -1 {
if dividend == INT_MIN {
return INT_MAX
}
return -dividend
}
if dividend == 0 {
return 0
}
if divisor == INT_MIN {
if dividend == INT_MIN {
return 1
}
return 0
}
remainder := 0
quotient := 0
flip := 1
if dividend > 0 {
if divisor < 0 {
flip = -1
divisor = -divisor
}
if divisor < BIG_NUMBER+1 {
bigDivisor := 0
for i := 0; i < BIG_NUMBER; i++ {
bigDivisor += divisor
}
bigQuotient := this.divideInternal(dividend, bigDivisor, &remainder)
quotient = this.divideInternal(remainder, divisor, &remainder)
temp := 0
for i := 0; i < BIG_NUMBER; i++ {
temp += bigQuotient
}
if flip > 0 {
return (temp + quotient)
} else {
return -(temp + quotient)
}
}
quotient = this.divideInternal(dividend, divisor, &remainder)
if flip > 0 {
return quotient
} else {
return -quotient
}
} else {
// Make sure bothdividend and divisor are negative
if divisor > 0 {
flip = -1
divisor = -divisor
}
if divisor > -BIG_NUMBER-1 {
bigDivisor := 0
for i := 0; i < BIG_NUMBER; i++ {
bigDivisor += divisor
}
bigQuotient := this.divideInternal(dividend, bigDivisor, &remainder)
quotient = this.divideInternal(remainder, divisor, &remainder)
temp := 0
for i := 0; i < BIG_NUMBER; i++ {
temp += bigQuotient
}
if flip > 0 {
return (temp + quotient)
} else {
return -(temp + quotient)
}
}
quotient = this.divideInternal(dividend, divisor, &remainder)
if flip > 0 {
return quotient
} else {
return -quotient
}
}
}
//int i = INT_MIN;
//cout << (-INT_MIN == INT_MIN) << endl;