divide-two-integers

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given two integers <code>dividend</code> and <code>divisor</code>, 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, <code>8.345</code> would be truncated to <code>8</code>, and <code>-2.7335</code> would be truncated to <code>-2</code>.

Return the quotient after dividing <code>dividend</code> by <code>divisor</code>.

Note: Assume we are dealing with an environment that could only store integers within the 32-bit signed integer range: <code>[&minus;231, 231 &minus; 1]</code>. For this problem, if the quotient is strictly greater than <code>231 - 1</code>, then return <code>231 - 1</code>, and if the quotient is strictly less than <code>-231</code>, then return <code>-231</code>.

&nbsp;
Example 1:

<pre>
Input: dividend = 10, divisor = 3
Output: 3
Explanation: 10/3 = 3.33333.. which is truncated to 3.
</pre>

Example 2:

<pre>
Input: dividend = 7, divisor = -3
Output: -2
Explanation: 7/-3 = -2.33333.. which is truncated to -2.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>-231 &lt;= dividend, divisor &lt;= 231 - 1</code></li>
	<li><code>divisor != 0</code></li>
</ul>