Problem
Given two integers dividend
and divisor
, divide two integers without using multiplication, division and mod operator.
Return the quotient after dividing dividend
by divisor
.
The integer division should truncate toward zero.
Example 1:
Input: dividend = 10, divisor = 3 Output: 3
Example 2:
Input: dividend = 7, divisor = -3 Output: -2
Note:
- Both dividend and divisor will be 32-bit signed integers.
- The divisor will never be 0.
- Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 231 − 1 when the division result overflows.
Code
public class Solution {
public int divide(int dividend, int divisor) {
int flag = 0;
long a = dividend;
long b = divisor;
if (a < 0) {
flag++;
a = -a;
}
if (b < 0) {
flag++;
b = -b;
}
long ret = 0;
for (int i = 30; i >= 0; --i) {
while (a >= b << i) {
a -= b << i;
ret += 1 << i;
}
}
//return (int)(flag == 1 ? -ret : ret);
if (flag == 1) {
ret = -ret;
}
if (ret > Integer.MAX_VALUE) {
ret = Integer.MAX_VALUE;
}
return (int) ret;
}
}