29. Divide Two Integers
Medium
5632703FavoriteShare
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.
class Solution {
public:
int divide(int dividend, int divisor) {
long A=dividend;
long B=divisor;
bool f=(A<0)!=(B<0);//1表示负
if(A<0)A=-A;
if(B<0)B=-B;
if(A<B)return 0;
long ans=0;
while(A>=B)
{
A-=B;
ans++;
}
if(f)ans=-ans;
if(ans>0x7fffffff)return 0x7fffffff;
else return (int)ans;
}
};