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.
解法一:太牛逼了
class Solution {
public int divide(int dividend, int divisor) {
boolean flag = (dividend>0)^(divisor>0);
int result = 0;
if(dividend>0) dividend = -dividend;
if(divisor>0) divisor = -divisor;
while(dividend<=divisor){
int tmp_result = -1;
int tmp_divisor = divisor;
while(dividend<=(tmp_divisor<<1)){
if(tmp_divisor<(Integer.MIN_VALUE>>1)) break;
tmp_result = tmp_result<<1;
tmp_divisor = tmp_divisor<<1;
}
dividend -= tmp_divisor;
result += tmp_result;
}
if(flag==false){
if(result==Integer.MIN_VALUE) result = Integer.MAX_VALUE;
else result = -result;
}
return result;
}
}