forked from mengli/leetcode
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDivideTwoIntegers.java
More file actions
Latest commit
46 lines (40 loc) · 1 KB
/
Copy pathDivideTwoIntegers.java
File metadata and controls
46 lines (40 loc) · 1 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
importjava.math.BigDecimal;
importjava.util.ArrayList;
/**
* Divide two integers without using multiplication, division and mod operator.
*/
publicclassDivideTwoIntegers {
publicintdivide(intdividend, intdivisor) {
if (dividend == 0)
return0;
ArrayList<Integer> list = newArrayList<Integer>();
BigDecimald0 = newBigDecimal(dividend);
d0 = d0.abs();
BigDecimald1;
BigDecimald3 = newBigDecimal(divisor);
d3 = d3.abs();
intcount = 0;
booleanstart = true;
while (d0.compareTo(d3) == 1 || d0.compareTo(d3) == 0) {
d1 = newBigDecimal(divisor);
d1 = d1.abs();
start = true;
while (d0.compareTo(d1) == 1 || d0.compareTo(d1) == 0) {
if (start) {
list.add(1);
start = false;
} else {
intlast = list.get(list.size() - 1);
list.add(last + last);
}
d0 = d0.subtract(d1);
d1 = d1.add(d1);
}
}
for (inte : list) {
count += e;
}
return (dividend < 0 && divisor < 0) || (dividend > 0 && divisor > 0) ? count
: -count;
}
}