Divide Two Integers(improve)

最新推荐文章于 2023-08-06 01:48:20 发布

转载最新推荐文章于 2023-08-06 01:48:20 发布 · 291 阅读

my leetcode 专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种不使用乘法、除法和取模运算符实现整数相除的方法。利用位移技巧来高效地计算商，对于正数和负数的情况进行了讨论，并给出了一段示例代码。

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

Same here, I would definitely do it in a nasty way. This shift thing really helps! Nice code!

class Solution:
    # @return an integer
    def divide(self, dividend, divisor):
        
        if (dividend > 0 and divisor > 0) or (dividend < 0 and divisor < 0):
            sign = 1
        else:
            sign = -1
        
        dividend = abs(dividend)
        divisor = abs(divisor)
        quotient = 0
        
        while dividend >= divisor:
            
            cnt = 0
            temp_divisor = divisor
            
            while dividend >= temp_divisor:
                
                quotient += (1 << cnt)
                
                dividend -= temp_divisor
                
                temp_divisor <<= 1
                
                cnt += 1
                
        return quotient * sign