-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathDivide Two Integer.java
40 lines (31 loc) · 1.15 KB
/
Divide Two Integer.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
/*
Divide two integers without using multiplication, division and mod operator.
*/
public class Solution {
public int divide(int dividend, int divisor) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
boolean negative = false;
//check if negative
if (dividend == 0) {
return 0;
}
if ((dividend < 0 && divisor > 0) ||(dividend > 0 && divisor < 0)) {
negative = true;
}
if (divisor == 1 || divisor == -1) {
return negative? (0 - Math.abs(dividend)) : Math.abs(dividend);
}
long dividend1 = Math.abs((long)dividend);
long divisor1 = Math.abs((long)divisor);
long remainder = dividend1;
int result = 0;
while (remainder >= divisor1) {
for (int i = 1; i * divisor1 <= remainder; i = i*2) {
remainder = remainder - i * divisor1;
result += i;
}
}
return negative? (0 - result) : result;
}
}