[LeetCode] Divide Two Integers

[LeetCode] Divide Two Integers

Divide two integers without using multiplication, division and mod operator.

If it is overflow, return MAX_INT.

Time Complexity log (n)

There is a coner case

Dividend =-2147483648

Divisor =-1;

The answer is 2147483647

Dividend =-2147483648

Divisor = 1

The answer is-2147483648 if the positive and negative judgments are placed at the end, overflow

Public class Solution {public int divide (int dividend, int divisor) {long a = dividend> 0? Dividend:-(long) dividend; long B = divisor> 0? Divisor:-(long) divisor; int sgn = (dividend> 0 & divisor> 0) | (dividend <0 & divisor <0 ))? 1:-1); int res = 0; while (a> = B) {long c = B; int I = 1; while (a> = c) {a-= c; if (a> = 0) {res + = sgn * (Math. pow (2, I-1);} else {break;} c <= 1; I ++ ;}} return res ;}}