1355. Divide Two Integers Without / Operator

Given a dividend a and a non-zero divisor b, compute the quotient using only shifts, additions and subtractions. The quotient truncates toward zero. If the result would exceed the signed 32-bit range, clamp it to 2147483647 (this happens for -2147483648 divided by -1).

Input: A JSON object {"a": <dividend>, "b": <non-zero divisor>}.

Output: Return the truncated quotient, clamped to the signed 32-bit range.

Examples

Input: {"a":10,"b":3}
Output: 3
Explanation: 10 / 3 truncates to 3.

Input: {"a":-2147483648,"b":-1}
Output: 2147483647
Explanation: The true quotient overflows, so it clamps to 2147483647.

Constraints

• -2^31 <= a <= 2^31 - 1
• b != 0 and -2^31 <= b <= 2^31 - 1

Asked by