Created
October 3, 2019 07:50
-
-
Save vitkarpov/7479a702a24c1bb6c7431fc9fdecfa6f to your computer and use it in GitHub Desktop.
Divide Two Integers (32 bits environment only, O(log n) time complexity)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* @param {number} dividend | |
* @param {number} divisor | |
* @return {number} | |
*/ | |
var divide = function(dividend, divisor) { | |
if (dividend == INT_MIN && divisor == -1) { | |
return INT_MAX; | |
} | |
const sign = (dividend > 0 && divisor > 0 || dividend < 0 && divisor < 0) ? 1 : -1; | |
dividend = Math.abs(dividend); | |
divisor = Math.abs(divisor); | |
let ans = 0; | |
while (dividend >= divisor) { | |
let shifts = 1; | |
let curr = divisor; | |
while (curr <= (dividend >> 1)) { | |
curr <<= 1; | |
shifts <<= 1; | |
} | |
ans += shifts; | |
dividend -= curr; | |
} | |
return sign * ans; | |
}; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment