29. Divide Two Integers leetcode python new season 2016

最新推荐文章于 2022-05-04 17:06:40 发布

hyperbolechi

最新推荐文章于 2022-05-04 17:06:40 发布

阅读量427

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 2016刷题

本文链接：https://blog.youkuaiyun.com/hyperbolechi/article/details/50503191

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文提供了一种方法，在不使用乘法、除法和取模操作的情况下，实现两个整数的除法运算。通过位移操作和减法实现除法逻辑，并考虑了边界情况和溢出问题。

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

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

If it is overflow, return MAX_INT.

class Solution(object):
    MAX_INT = 0x7FFFFFFF
    def divide(self, dividend, divisor):
        """
        :type dividend: int
        :type divisor: int
        :rtype: int
        """
        if dividend == 0:
            return 0
        if divisor == 0:
            return self.MAX_INT
        negative = (dividend > 0) ^ (divisor > 0)
        dividend, divisor = abs(dividend), abs(divisor)
        result = 0
        while dividend >= divisor:
            divisor_sum = divisor
            count = 1
            while divisor_sum << 1 <= dividend:
                divisor_sum <<= 1
                count <<= 1
            dividend -= divisor_sum
            result += count
        result = self.MAX_INT if not negative and result > self.MAX_INT else result
        return -result if negative else result