-
Notifications
You must be signed in to change notification settings - Fork 0
/
29.java
51 lines (50 loc) · 1.51 KB
/
29.java
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
// https://leetcode.com/problems/divide-two-integers/
public class Solution {
public int divide(int dividend, int divisor) {
if(divisor == 0) throw new RuntimeException("divisor can't be 0");
if(divisor == 1) return dividend;
if(dividend == Integer.MIN_VALUE && divisor == -1) return Integer.MAX_VALUE;
if(dividend == Integer.MIN_VALUE && divisor == Integer.MIN_VALUE) return 1;
if(divisor == Integer.MIN_VALUE) return 0;
int sign = 1;
int carry = 0;
if(dividend < 0) {
sign *= -1;
dividend *= -1;
if(dividend < 0) {
carry = 1;
dividend = Integer.MAX_VALUE;
}
}
if(divisor < 0) {
sign *= -1;
divisor *= -1;
}
// yu = dividend/ divisor;
int yu = 0;
int count = 0;
int d = divisor;
while((d<<1) > 0 && d < dividend) {
d<<=1;
count++;
}
if((d << 1) > 0) {
d >>= 1;
count --;
}
//System.out.println(d + " : " + dividend + " : " + count);
while(count >= 0) {
yu <<=1;
if(dividend >= d) {
dividend = dividend - d;
yu++;
}
//System.out.println(dividend + " ! " + d + " ! " + yu);
d >>= 1;
count--;
}
if(carry + dividend >= divisor)
yu++;
return yu * sign;
}
}