-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProblem29.java
More file actions
72 lines (63 loc) · 1.91 KB
/
Problem29.java
File metadata and controls
72 lines (63 loc) · 1.91 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
class Problem29 {
public static void main(String[] args) {
Problem29 p = new Problem29();
System.out.println(p.divide(2147483647, 2));
}
public int divide(int dividend, int divisor) {
boolean flag = true;
if (dividend <= Integer.MIN_VALUE) {
if (divisor == 1) {
return Integer.MIN_VALUE;
} else if (divisor == -1) {
return Integer.MAX_VALUE;
}
}
if (dividend < 0) {
flag = false;
dividend = - dividend;
}
if (divisor < 0) {
if (!flag) flag = true;
else flag = false;
divisor = - divisor;
}
if (divisor == 1) {
return flag ? dividend : -dividend;
}
//String dividendStr = Integer.toBinaryString(dividend);
//String divisorStr = Integer.toBinaryString(divisor);
/*
System.out.println(dividendStr);
System.out.println(divisorStr);
boolean flagF = true;
long dividendStrLong = Long.parseLong(dividendStr);
long divisorLong = Long.parseLong(divisorStr);
StringBuffer buffer = new StringBuffer();
*/
long res = 0;
int divis = divisor;
while ( dividend > 0) {
int q = 1;
while (dividend > (divisor << 1)) {
divisor = divisor << 1;
q = q << 1;
}
if (dividend < divisor) {
dividend = 0;
q = 0;
} else {
dividend = dividend - divisor;
divisor = divis;
}
res += q;
}
res = flag ? res : -res;
if (res >= Integer.MAX_VALUE) {
res = Integer.MAX_VALUE;
}
if (res <= Integer.MIN_VALUE) {
res = Integer.MIN_VALUE;
}
return (int)res;
}
}