Divide Two Integers

最新推荐文章于 2019-09-05 23:46:17 发布

原创最新推荐文章于 2019-09-05 23:46:17 发布 · 466 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode——坚持每天一题专栏收录该内容

176 篇文章

订阅专栏

本文介绍了一种不使用乘法、除法和取模运算符来实现两个整数相除的方法。通过位移操作实现了高效的除法计算，并处理了溢出情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Divide Two Integers

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

If it is overflow, return MAX_INT.

Java代码：

public class Solution {
    public int divide(int dividend, int divisor) {
        long dividend_l = (long)dividend;
        long divisor_l = (long)divisor;
        int sign = (dividend > 0 && divisor > 0) || 
                   (dividend < 0 && divisor < 0) ? 1 : -1;
        dividend_l = Math.abs(dividend_l);
        divisor_l= Math.abs(divisor_l);
        if (dividend_l < divisor_l) {
            return 0;
        }
        long div_base = divisor_l;
        long base = 1;
        while ((div_base << 1) <= dividend_l) {
            base <<= 1;
            div_base <<=1;
        }
        long value = 0;
        while (dividend_l > 0 && div_base >= divisor_l) {
            if (dividend_l >= div_base) {
                value += base;
                dividend_l -= div_base;
            }
            base>>=1;
            div_base>>=1;
        }

        if (sign > 0) {
            return (int)Math.min(value, Integer.MAX_VALUE);
        } else {
            return (int)-value;
        }
    }
}