Leetcode 29. Divide Two Integers [medium][java]

最新推荐文章于 2019-11-08 09:45:20 发布

原创最新推荐文章于 2019-11-08 09:45:20 发布 · 407 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

本文介绍了一种不使用乘法、除法和取模运算符进行整数除法的方法。通过位移操作实现了两个整数的除法，并提供了两种解决方案，确保了结果向零截断。文章详细解释了算法步骤，包括处理溢出情况和负数的逻辑。

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
在这里插入图片描述

Ignored Cases

overflow
time limitation

Important note

In java, digit << 1 means multiple the digit by 2, while digit >> 1 means divide the digit by 2.

Solution 1

class Solution {
    public int divide(int dividend, int divisor) {
        // if dividend = Integer.MIN_VALUE && divisor = -1, the result will overflow.
        if(dividend == Integer.MIN_VALUE && divisor == -1)
            return Integer.MAX_VALUE;
        
        
        boolean neg = false;
        if((dividend < 0 && divisor > 0) || (dividend > 0 && divisor < 0))
            neg = true;
        long a = Math.abs((long)dividend);
        long b = Math.abs((long)divisor);
        int res = 0;
        while(a >= b) {
            int quo = 1;
            long t = b;
            while(a >= (t<<1)) {
                quo = quo<<1;
                t = t<<1;
            }
            res += quo;
            a -= t;
        }
        if(neg) 
            res = -res;
        return res;
    }
}

Solution 2

class Solution {
    public int divide(int dividend, int divisor) {
        // if dividend = Integer.MIN_VALUE && divisor = -1, the result will overflow.
        if(dividend == Integer.MIN_VALUE && divisor == -1)
            return Integer.MAX_VALUE;
        
        
        boolean neg = false;
        if((dividend < 0 && divisor > 0) || (dividend > 0 && divisor < 0))
            neg = true;
        long a = Math.abs((long)dividend);
        long b = Math.abs((long)divisor);
        int res = 0;
        while(a >= b) {
            int quo = 0;
            long t = b;
            while(a >= (t<<quo)) {
                ++quo;
            }
            res += 1<<(quo-1);
            a -= b<<(quo-1);
        }
        if(neg) 
            res = -res;
        return res;
    }
}

Reference

标签

#leetcode