leetcode-29

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.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/divide-two-integers
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class Solution {
    public int divide(int dividend, int divisor) {
        boolean sign = (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 = dividend - tmp_divisor;
            result += tmp_result;
        }
        if(!sign){
            if(result <= Integer.MIN_VALUE){
                return Integer.MAX_VALUE;
            }
            result = -result;
        }
        return result;
    }
}