Leetcode||29. Divide Two Integers

29. Divide Two Integers

• Total Accepted: 84976
• Total Submissions: 533627
• Difficulty: Medium
• Contributors: Admin

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

If it is overflow, return MAX_INT.

一个不能做除法的除法……参照别人的代码写的

代码如下：

public class Solution {
    public int divide(int dividend, int divisor) {
        if (divisor == 0) {
			return dividend >= 0? Integer.MAX_VALUE : Integer.MIN_VALUE;
        }
		if (dividend == 0) {
			return 0;
		}
		if (dividend == Integer.MIN_VALUE && divisor == -1) {
			return Integer.MAX_VALUE;
		}
		boolean isNegative = (dividend < 0 && divisor > 0) || (dividend > 0 && divisor < 0);
		long a = Math.abs((long)dividend);
		long b = Math.abs((long)divisor);
		int result = 0;
		while (a >= b) {
			int shift = 0;
			while (a >= (b << shift)) {
				shift++;
			}
			a -= b << (shift - 1);
			result += 1 << (shift - 1);
		}
		return isNegative? -result: result;
    }
}