-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram6.java
More file actions
66 lines (43 loc) · 1.76 KB
/
program6.java
File metadata and controls
66 lines (43 loc) · 1.76 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
/*
29. Divide Two Integers
Medium
4.2K
13.2K
Companies
Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.
The integer division should truncate toward zero, which means losing its fractional part. For example, 8.345 would be truncated to 8, and -2.7335 would be truncated to -2.
Return the quotient after dividing dividend by divisor.
Note: Assume we are dealing with an environment that could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For this problem, if the quotient is strictly greater than 231 - 1, then return 231 - 1, and if the quotient is strictly less than -231, then return -231.
Example 1:
Input: dividend = 10, divisor = 3
Output: 3
Explanation: 10/3 = 3.33333.. which is truncated to 3.
Example 2:
Input: dividend = 7, divisor = -3
Output: -2
Explanation: 7/-3 = -2.33333.. which is truncated to -2.
*/
package LeetCode;
public class program6 {
public static void main(String[] args) {
boolean flag =false;
long dividend = -2147483648;
long divisor =-1;
if(dividend < 0 && divisor >0 || dividend > 0 && divisor < 0 ){
flag =true;
}
long dividend1 = Math.abs((long)dividend);
long divisor1 = Math.abs((long)divisor);
System.out.println(dividend1);
System.out.println(divisor1);
int quotient =0;
while(dividend1 >= divisor1){
dividend1 -= divisor1;
quotient++;
}
if(flag){
quotient = -quotient;
}
System.out.println(quotient);
}
}