LeetCode Top Interview Questions 29. Divide Two Integers (Java版; Medium)
题目描述
Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.
Return the quotient after dividing dividend by divisor.
The integer division should truncate toward zero.
Example 1:
Input: dividend = 10, divisor = 3
Output: 3
Example 2:
Input: dividend = 7, divisor = -3
Output: -2
Note:
Both dividend and divisor will be 32-bit signed integers.
The divisor will never be 0.
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1].
For the purpose of this problem, assume that your function returns 231 − 1 when the division result overflows
classSolution{publicintdivide(int dividend,int divisor){int flag = dividend>0^ divisor>0?-1:1;int res =0;if(dividend==Integer.MIN_VALUE){if(divisor==-1){return Integer.MAX_VALUE;}if(divisor==Integer.MIN_VALUE){return1;}
dividend = dividend + Math.abs(divisor);
res++;}//if(divisor==Integer.MIN_VALUE){return0;}
dividend = Math.abs(dividend);
divisor = Math.abs(divisor);while(dividend >= divisor){int count =1;int cur = divisor;//cur >= 2*curwhile(dividend - cur >= cur){
count = count *2;//
cur = cur *2;}
res = res + count;
dividend = dividend - cur;}return res*flag;}}
LeetCode Top Interview Questions 29. Divide Two Integers (Java版; Medium)
welcome to my blogLeetCode Top Interview Questions 29. Divide Two Integers (Java版; Medium)题目描述Given two integers dividend and divisor, divide two integers without using multiplication, division and...