29. Divide Two Integers

```Solution.c int divide(int dividend, int divisor) { if (dividend == INT_MIN && divisor == -1) return INT_MAX; if (dividend == INT_MIN && divisor == 1) return INT_MIN; long a = labs((long)dividend); long b = labs((long)divisor); long res = 0; while (a >= b) { long temp = b, multiple = 1; while ((temp << 1) <= a) { temp <<= 1; multiple <<= 1; } a -= temp; res += multiple; } return ((dividend > 0) ^ (divisor > 0)) ? -res : res; } ``` ```Solution.cpp class Solution { public: int divide(int dividend, int divisor) { if (dividend == INT_MIN && divisor == -1) return INT_MAX; if (dividend == INT_MIN && divisor == 1) return INT_MIN; long long a = labs((long long)dividend); long long b = labs((long long)divisor); long long res = 0; while (a >= b) { long long temp = b, multiple = 1; while ((temp << 1) <= a) { temp <<= 1; multiple <<= 1; } a -= temp; res += multiple; } return ((dividend > 0) ^ (divisor > 0)) ? -res : res; } }; ``` ```Solution.cs public class Solution { public int Divide(int dividend, int divisor) { if (dividend == int.MinValue && divisor == -1) return int.MaxValue; if (dividend == int.MinValue && divisor == 1) return int.MinValue; long a = Math.Abs((long)dividend); long b = Math.Abs((long)divisor); long res = 0; while (a >= b) { long temp = b, multiple = 1; while ((temp << 1) <= a) { temp <<= 1; multiple <<= 1; } a -= temp; res += multiple; } return ((dividend > 0) ^ (divisor > 0)) ? (int)-res : (int)res; } } ``` ```Solution.dart class Solution { int divide(int dividend, int divisor) { const intMax = 2147483647; const intMin = -2147483648; if (dividend == intMin && divisor == -1) return intMax; if (dividend == intMin && divisor == 1) return intMin; int a = dividend.abs(); int b = divisor.abs(); int res = 0; while (a >= b) { int temp = b, multiple = 1; while ((temp << 1) <= a) { temp <<= 1; multiple <<= 1; } a -= temp; res += multiple; } return ((dividend > 0) ^ (divisor > 0)) ? -res : res; } } ``` ```Solution.erl -spec divide(integer(), integer()) -> integer(). divide(Dividend, Divisor) -> IntMax = (1 bsl 31) - 1, IntMin = -(1 bsl 31), case {Dividend, Divisor} of {IntMin, -1} -> IntMax; {IntMin, 1} -> IntMin; _ -> A = abs(Dividend), B = abs(Divisor), Res = divide_loop(A, B, 0), if (Dividend > 0) xor (Divisor > 0) -> -Res; true -> Res end end. divide_loop(A, B, Res) when A < B -> Res; divide_loop(A, B, Res) -> {Temp, Multiple} = double_loop(B, A, B, 1), divide_loop(A - Temp, B, Res + Multiple). double_loop(Temp, A, TempAcc, Multiple) -> case (TempAcc bsl 1) =< A of true -> double_loop(Temp, A, TempAcc bsl 1, Multiple bsl 1); false -> {TempAcc, Multiple} end. ``` ```Solution.ex defmodule Solution do @SPEC divide(integer, integer) :: integer def divide(dividend, divisor) do int_max = 2_147_483_647 int_min = -2_147_483_648 cond do dividend == int_min and divisor == -1 -> int_max dividend == int_min and divisor == 1 -> int_min true -> a = abs(dividend) b = abs(divisor) res = loop(a, b, 0) if (dividend > 0) != (divisor > 0), do: -res, else: res end end defp loop(a, b, res) when a < b, do: res defp loop(a, b, res) do {temp, multiple} = double_loop(b, a, b, 1) loop(a - temp, b, res + multiple) end defp double_loop(_b, a, temp, multiple) when temp * 2 > a, do: {temp, multiple} defp double_loop(b, a, temp, multiple), do: double_loop(b, a, temp * 2, multiple * 2) end ``` ```Solution.go func divide(dividend int, divisor int) int { if dividend == math.MinInt32 && divisor == -1 { return math.MaxInt32 } if dividend == math.MinInt32 && divisor == 1 { return math.MinInt32 } a, b := abs(dividend), abs(divisor) res := 0 for a >= b { temp, multiple := b, 1 for (temp << 1) <= a { temp <<= 1 multiple <<= 1 } a -= temp res += multiple } if (dividend > 0) != (divisor > 0) { return -res } return res } func abs(x int) int { if x < 0 { return -x } return x } ``` ```Solution.java class Solution { public int divide(int dividend, int divisor) { if (dividend == Integer.MIN_VALUE && divisor == -1) return Integer.MAX_VALUE; if (dividend == Integer.MIN_VALUE && divisor == 1) return Integer.MIN_VALUE; long a = Math.abs((long) dividend); long b = Math.abs((long) divisor); long res = 0; while (a >= b) { long temp = b, multiple = 1; while ((temp << 1) <= a) { temp <<= 1; multiple <<= 1; } a -= temp; res += multiple; } return ((dividend > 0) ^ (divisor > 0)) ? (int)-res : (int)res; } } ``` ```Solution.js /** * @param {number} dividend * @param {number} divisor * @return {number} */ var divide = function(dividend, divisor) { const INT_MAX = 2 ** 31 - 1; const INT_MIN = -(2 ** 31); if (divisor === 0) return INT_MAX; if (dividend === INT_MIN && divisor === -1) return INT_MAX; if (dividend === INT_MIN && divisor === 1) return INT_MIN; let a = Math.abs(dividend); let b = Math.abs(divisor); let res = 0; while (a >= b) { let temp = b, multiple = 1; while (temp + temp <= a) { temp += temp; multiple += multiple; } a -= temp; res += multiple; } const negative = (dividend < 0) !== (divisor < 0); return negative ? -res : res; }; ``` ```Solution.kt class Solution { fun divide(dividend: Int, divisor: Int): Int { if (dividend == Int.MIN_VALUE && divisor == -1) return Int.MAX_VALUE var a = dividend.toLong() var b = divisor.toLong() val negative = (a < 0) xor (b < 0) a = kotlin.math.abs(a) b = kotlin.math.abs(b) var result = 0L for (i in 31 downTo 0) { if ((a shr i) >= b) { result += 1L shl i a -= b shl i } } if (negative) result = -result if (result > Int.MAX_VALUE) return Int.MAX_VALUE if (result < Int.MIN_VALUE) return Int.MIN_VALUE return result.toInt() } } ``` ```Solution.php class Solution { /** * @param Integer $dividend * @param Integer $divisor * @return Integer */ function divide($dividend, $divisor) { $INT_MAX = 2 ** 31 - 1; $INT_MIN = -(2 ** 31); if ($dividend == $INT_MIN && $divisor == -1) return $INT_MAX; if ($dividend == $INT_MIN && $divisor == 1) return $INT_MIN; $a = abs($dividend); $b = abs($divisor); $res = 0; while ($a >= $b) { $temp = $b; $multiple = 1; while (($temp << 1) <= $a) { $temp <<= 1; $multiple <<= 1; } $a -= $temp; $res += $multiple; } return (($dividend > 0) ^ ($divisor > 0)) ? -$res : $res; } } ``` ```Solution.py class Solution: def divide(self, dividend: int, divisor: int) -> int: INT_MAX, INT_MIN = 2**31 - 1, -2**31 if dividend == INT_MIN and divisor == -1: return INT_MAX if dividend == INT_MIN and divisor == 1: return INT_MIN a, b = abs(dividend), abs(divisor) res = 0 while a >= b: temp, multiple = b, 1 while (temp << 1) <= a: temp <<= 1 multiple <<= 1 a -= temp res += multiple return -res if (dividend > 0) ^ (divisor > 0) else res ``` ```Solution.rb # @param {Integer} dividend # @param {Integer} divisor # @return {Integer} def divide(dividend, divisor) int_max = (2**31) - 1 int_min = -(2**31) return int_max if dividend == int_min && divisor == -1 return int_min if dividend == int_min && divisor == 1 a, b = dividend.abs, divisor.abs res = 0 while a >= b temp, multiple = b, 1 while (temp << 1) <= a temp <<= 1 multiple <<= 1 end a -= temp res += multiple end (dividend > 0) ^ (divisor > 0) ? -res : res end ``` ```Solution.rkt (define (divide dividend divisor) (define INT_MAX (- (expt 2 31) 1)) (define INT_MIN (- (expt 2 31))) (cond [(and (= dividend INT_MIN) (= divisor -1)) INT_MAX] [(and (= dividend INT_MIN) (= divisor 1)) INT_MIN] [else (let loop ((a (abs dividend)) (b (abs divisor)) (res 0)) (if (< a b) (if (xor (> dividend 0) (> divisor 0)) (- res) res) (let loop2 ((temp b) (multiple 1)) (if (<= (* 2 temp) a) (loop2 (* 2 temp) (* 2 multiple)) (loop (- a temp) b (+ res multiple))))))])) ``` ```Solution.rs impl Solution { pub fn divide(dividend: i32, divisor: i32) -> i32 { if dividend == i32::MIN && divisor == -1 { return i32::MAX; } if dividend == i32::MIN && divisor == 1 { return i32::MIN; } let mut a = (dividend as i64).abs(); let b = (divisor as i64).abs(); let mut res = 0i64; while a >= b { let mut temp = b; let mut multiple = 1i64; while (temp << 1) <= a { temp <<= 1; multiple <<= 1; } a -= temp; res += multiple; } if (dividend > 0) ^ (divisor > 0) { -res as i32 } else { res as i32 } } } ``` ```Solution.scala object Solution { def divide(dividend: Int, divisor: Int): Int = { val INT_MAX = Int.MaxValue val INT_MIN = Int.MinValue if (dividend == INT_MIN && divisor == -1) return INT_MAX if (dividend == INT_MIN && divisor == 1) return INT_MIN var a = Math.abs(dividend.toLong) var b = Math.abs(divisor.toLong) var res = 0L while (a >= b) { var temp = b var multiple = 1L while ((temp << 1) <= a) { temp <<= 1 multiple <<= 1 } a -= temp res += multiple } if ((dividend > 0) ^ (divisor > 0)) -res.toInt else res.toInt } } ``` ```Solution.swift class Solution { func divide(_ dividend: Int, _ divisor: Int) -> Int { let INT_MAX = 2_147_483_647 let INT_MIN = -2_147_483_648 if dividend == INT_MIN && divisor == -1 { return INT_MAX } if dividend == INT_MIN && divisor == 1 { return INT_MIN } let negative = (dividend > 0) != (divisor > 0) var a = abs(dividend) var b = abs(divisor) var res = 0 while a >= b { var temp = b var multiple = 1 while a >= temp + temp { temp += temp multiple += multiple } a -= temp res += multiple } return negative ? -res : res } } ``` ```Solution.ts function divide(dividend: number, divisor: number): number { const INT_MAX = 2 ** 31 - 1; const INT_MIN = -(2 ** 31); if (dividend === INT_MIN && divisor === -1) return INT_MAX; if (dividend === INT_MIN && divisor === 1) return INT_MIN; const negative = (dividend > 0) !== (divisor > 0); let a = Math.abs(dividend); let b = Math.abs(divisor); let res = 0; while (a >= b) { let temp = b; let multiple = 1; while (a >= temp + temp) { temp += temp; multiple += multiple; } a -= temp; res += multiple; } return negative ? -res : res; } ```

Author: nendroids

sol/solution/0001-0100/0029/README.md

@@ -0,0 +1,27 @@
+# [**29. Divide Two Integers**](https://leetcode.com/problems/divide-two-integers/description/)
+
+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: `[−2³¹, 2³¹ − 1]`. For this problem, if the quotient is **strictly greater than** `2³¹ - 1`, then return `2³¹ - 1`, and if the quotient is **strictly less than** `-2³¹`, then return `-2³¹`.
+
+#### **Example 1:**
+```md
+Input: dividend = 10, divisor = 3
+Output: 3
+Explanation: 10/3 = 3.33333.. which is truncated to 3.
+```
+
+#### **Example 2:**
+```md
+Input: dividend = 7, divisor = -3
+Output: -2
+Explanation: 7/-3 = -2.33333.. which is truncated to -2.
+```
+
+#### **Constraints:**
+> - `-2³¹ <= dividend, divisor <= 2³¹ - 1`
+> - `divisor != 0`

sol/solution/0001-0100/0029/Solution.c

@@ -0,0 +1,17 @@
+int divide(int dividend, int divisor) {
+ if (dividend == INT_MIN && divisor == -1) return INT_MAX;
+ if (dividend == INT_MIN && divisor == 1) return INT_MIN;
+ long a = labs((long)dividend);
+ long b = labs((long)divisor);
+ long res = 0;
+ while (a >= b) {
+ long temp = b, multiple = 1;
+ while ((temp << 1) <= a) {
+ temp <<= 1;
+ multiple <<= 1;
+ }
+ a -= temp;
+ res += multiple;
+ }
+ return ((dividend > 0) ^ (divisor > 0)) ? -res : res;
+}

sol/solution/0001-0100/0029/Solution.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+ int divide(int dividend, int divisor) {
+ if (dividend == INT_MIN && divisor == -1) return INT_MAX;
+ if (dividend == INT_MIN && divisor == 1) return INT_MIN;
+ long long a = labs((long long)dividend);
+ long long b = labs((long long)divisor);
+ long long res = 0;
+ while (a >= b) {
+ long long temp = b, multiple = 1;
+ while ((temp << 1) <= a) {
+ temp <<= 1;
+ multiple <<= 1;
+ }
+ a -= temp;
+ res += multiple;
+ }
+ return ((dividend > 0) ^ (divisor > 0)) ? -res : res;
+ }
+};

sol/solution/0001-0100/0029/Solution.cs

@@ -0,0 +1,19 @@
+public class Solution {
+ public int Divide(int dividend, int divisor) {
+ if (dividend == int.MinValue && divisor == -1) return int.MaxValue;
+ if (dividend == int.MinValue && divisor == 1) return int.MinValue;
+ long a = Math.Abs((long)dividend);
+ long b = Math.Abs((long)divisor);
+ long res = 0;
+ while (a >= b) {
+ long temp = b, multiple = 1;
+ while ((temp << 1) <= a) {
+ temp <<= 1;
+ multiple <<= 1;
+ }
+ a -= temp;
+ res += multiple;
+ }
+ return ((dividend > 0) ^ (divisor > 0)) ? (int)-res : (int)res;
+ }
+}

sol/solution/0001-0100/0029/Solution.dart

@@ -0,0 +1,21 @@
+class Solution {
+ int divide(int dividend, int divisor) {
+ const intMax = 2147483647;
+ const intMin = -2147483648;
+ if (dividend == intMin && divisor == -1) return intMax;
+ if (dividend == intMin && divisor == 1) return intMin;
+ int a = dividend.abs();
+ int b = divisor.abs();
+ int res = 0;
+ while (a >= b) {
+ int temp = b, multiple = 1;
+ while ((temp << 1) <= a) {
+ temp <<= 1;
+ multiple <<= 1;
+ }
+ a -= temp;
+ res += multiple;
+ }
+ return ((dividend > 0) ^ (divisor > 0)) ? -res : res;
+ }
+}

sol/solution/0001-0100/0029/Solution.erl

@@ -0,0 +1,25 @@
+-spec divide(integer(), integer()) -> integer().
+divide(Dividend, Divisor) ->
+ IntMax = (1 bsl 31) - 1,
+ IntMin = -(1 bsl 31),
+ case {Dividend, Divisor} of
+ {IntMin, -1} -> IntMax;
+ {IntMin, 1} -> IntMin;
+ _ ->
+ A = abs(Dividend),
+ B = abs(Divisor),
+ Res = divide_loop(A, B, 0),
+ if (Dividend > 0) xor (Divisor > 0) -> -Res;
+ true -> Res
+ end
+ end.
+divide_loop(A, B, Res) when A < B -> Res;
+divide_loop(A, B, Res) ->
+ {Temp, Multiple} = double_loop(B, A, B, 1),
+ divide_loop(A - Temp, B, Res + Multiple).
+
+double_loop(Temp, A, TempAcc, Multiple) ->
+ case (TempAcc bsl 1) =< A of
+ true -> double_loop(Temp, A, TempAcc bsl 1, Multiple bsl 1);
+ false -> {TempAcc, Multiple}
+ end.

sol/solution/0001-0100/0029/Solution.ex

@@ -0,0 +1,23 @@
+defmodule Solution do
+ @spec divide(integer, integer) :: integer
+ def divide(dividend, divisor) do
+ int_max = 2_147_483_647
+ int_min = -2_147_483_648
+ cond do
+ dividend == int_min and divisor == -1 -> int_max
+ dividend == int_min and divisor == 1 -> int_min
+ true ->
+ a = abs(dividend)
+ b = abs(divisor)
+ res = loop(a, b, 0)
+ if (dividend > 0) != (divisor > 0), do: -res, else: res
+ end
+ end
+ defp loop(a, b, res) when a < b, do: res
+ defp loop(a, b, res) do
+ {temp, multiple} = double_loop(b, a, b, 1)
+ loop(a - temp, b, res + multiple)
+ end
+ defp double_loop(_b, a, temp, multiple) when temp * 2 > a, do: {temp, multiple}
+ defp double_loop(b, a, temp, multiple), do: double_loop(b, a, temp * 2, multiple * 2)
+end

sol/solution/0001-0100/0029/Solution.go

@@ -0,0 +1,29 @@
+func divide(dividend int, divisor int) int {
+ if dividend == math.MinInt32 && divisor == -1 {
+ return math.MaxInt32
+ }
+ if dividend == math.MinInt32 && divisor == 1 {
+ return math.MinInt32
+ }
+ a, b := abs(dividend), abs(divisor)
+ res := 0
+ for a >= b {
+ temp, multiple := b, 1
+ for (temp << 1) <= a {
+ temp <<= 1
+ multiple <<= 1
+ }
+ a -= temp
+ res += multiple
+ }
+ if (dividend > 0) != (divisor > 0) {
+ return -res
+ }
+ return res
+}
+func abs(x int) int {
+ if x < 0 {
+ return -x
+ }
+ return x
+}

sol/solution/0001-0100/0029/Solution.java

@@ -0,0 +1,19 @@
+class Solution {
+ public int divide(int dividend, int divisor) {
+ if (dividend == Integer.MIN_VALUE && divisor == -1) return Integer.MAX_VALUE;
+ if (dividend == Integer.MIN_VALUE && divisor == 1) return Integer.MIN_VALUE;
+ long a = Math.abs((long) dividend);
+ long b = Math.abs((long) divisor);
+ long res = 0;
+ while (a >= b) {
+ long temp = b, multiple = 1;
+ while ((temp << 1) <= a) {
+ temp <<= 1;
+ multiple <<= 1;
+ }
+ a -= temp;
+ res += multiple;
+ }
+ return ((dividend > 0) ^ (divisor > 0)) ? (int)-res : (int)res;
+ }
+}

sol/solution/0001-0100/0029/Solution.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number} dividend
+ * @param {number} divisor
+ * @return {number}
+ */
+var divide = function(dividend, divisor) {
+ const INT_MAX = 2 ** 31 - 1;
+ const INT_MIN = -(2 ** 31);
+ if (divisor === 0) return INT_MAX;
+ if (dividend === INT_MIN && divisor === -1) return INT_MAX;
+ if (dividend === INT_MIN && divisor === 1) return INT_MIN;
+ let a = Math.abs(dividend);
+ let b = Math.abs(divisor);
+ let res = 0;
+ while (a >= b) {
+ let temp = b, multiple = 1;
+ while (temp + temp <= a) {
+ temp += temp;
+ multiple += multiple;
+ }
+ a -= temp;
+ res += multiple;
+ }
+ const negative = (dividend < 0) !== (divisor < 0);
+ return negative ? -res : res;
+};