每天一道算法题2

最新推荐文章于 2022-06-27 16:50:27 发布

shiershier1234

最新推荐文章于 2022-06-27 16:50:27 发布

阅读量221

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/shiershier1234/article/details/82851551

这是一道关于不使用乘法、除法和取模运算符进行整数除法的算法题。题目要求在32位整数范围内返回除法的商，当结果溢出时返回最大32位整数值。文章提供了具体的例子和解决方案。

第2题：Divide Two Integers

描述：

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 1:

Input: dividend = 10, divisor = 3
Output: 3

Example 2:

Input: dividend = 7, divisor = -3
Output: -2

Note:

Both dividend and divisor will be 32-bit signed integers.
The divisor will never be 0.
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−2^31, 2^31 − 1]. For the purpose of this problem, assume that your function returns 2^31 − 1 when the division result overflows.

算法代码一

class Solution:
# @return an integer
    def divide(self, dividend, divisor):
        positive = (dividend < 0) is (divisor < 0)
        dividend, divisor = abs(dividend), abs(divisor)
        res = 0
        while dividend >= divisor:
            temp, i = divisor, 1
            while dividend >= temp:
                dividend -= temp
                res += i
                i <<= 1
                temp <<= 1
        if not positive:
            res = -res
        return min(max(-2147483648, res), 2147483647)