29. Divide Two Integers

于 2020-09-10 16:07:30 发布
阅读量93 收藏
点赞数
分类专栏： leetcode 文章标签： leetcode go
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_43550014/article/details/108514126
版权
这篇博客讨论了如何在不使用乘法、除法和取模运算符的情况下，用Go语言解决LeetCode上的29题——整数除法。文章通过分析特殊案例，提出两种方法：优化后的减法和递归加法与移位，详细阐述了这两种方法的思路、时间和空间复杂度，并给出了代码实现。最终推荐了效率更高的二分法。
摘要由CSDN通过智能技术生成

29. 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, which means losing its fractional part. For example, truncate(8.345) = 8 and truncate(-2.7335) = -2.

Example 1:
Input: dividend = 10, divisor = 3
Output: 3
Explanation: 10/3 = truncate(3.33333…) = 3.

Example 2:
Input: dividend = 7, divisor = -3
Output: -2
Explanation: 7/-3 = truncate(-2.33333…) = -2.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/divide-two-integers
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

Think and method
Before describing the method, we need to consider a few special cases.

最低0.47元/天 解锁文章
yuSnwang
关注
专栏目录
Leetcode 29. Divide Two Integers--两个32位整数相除，小数位截断，不能使用乘法、除法、取模运算
Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发
01-13 329
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 sho...
[LeetCode]--29. Divide Two Integers
杜鲁门的博客
10-28 404
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.以前我记得做过乘法变加法吧，这个有点像除法变减法，用位运算，二进制嘛，左移一位相当于乘以二。一个有趣的是 Math.abs(-2147483648) 结果还是 -2147483648
Divide Two Integers
weixin_30784501的博客
07-16 79
Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 思路：实现两个整数的除法，不能使用乘法，除法和移位操作。首先想到的是减法，但是减法速度太慢，比如10000000/1，总共需要10000000次减法，所以不适用。 ...
divide-two-integers
qq_40722582的博客
09-05 181
https://www.nowcoder.com/practice/472c6e8772bd4f1299fbe4a60f3b54f7?tpId=46&tqId=29150&tPage=1&rp=1&ru=/ta/leetcode&qru=/ta/leetcode/question-ranking 思路：除数成倍的减少，统计减少多少次 class Sol...
LeetCode 29. 两数相除 Divide Two Integers（C语言）
hang404的博客
12-21 534
题目描述： 给定两个整数，被除数 dividend 和除数 divisor。将两数相除，要求不使用乘法、除法和 mod 运算符。 返回被除数 dividend 除以除数 divisor 得到的商。 示例 1: 输入: dividend = 10, divisor = 3 输出: 3 示例 2: 输入: dividend = 7, divisor = -3 输出: -2 说明: 被除数和除...
leetcode题解第29题 Divide Two Integers （两数相除）
笔墨留年。
11-06 513
题目的大意如下： 给定两个整数，被除数 dividend 和除数 divisor。将两数相除，要求不使用乘法、除法和 mod 运算符。返回被除数 dividend 除以除数 divisor 得到的商。 简单来说，就是需要在不借助python内部的乘、除、去余运算的情况下，实现整数除法运算，并返回运算的商的。余数忽略。 且在此之外，还有几点额外说明： 除数永远不会为0。 被除数和除数都是32位...
Divide Two Integers(C++)
zrh_CSDN的博客
05-24 281
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 ...
Divide Two Integers（两个整数相除）
zyzn1425077119的博客
09-04 678
//参考derrantcm的博客，网址：https://blog.csdn.net/DERRANTCM/article/details/47052683 package algorithm; /* *https://blog.csdn.net/DERRANTCM/article/details/47052683 * 2个整数相除，不使用除法，乘法，取余 原题 　　Divide two i...
[leetcode] Divide Two Integers
Cabinathor的专栏
06-17 319
From : https://leetcode.com/problems/divide-two-integers/ Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. class Solution { pub
<29>——Divide Two Integers
叙以流火述烽烟丶
09-09 182
29、Divide Two Integers
1. Dividing Two Integers (2’) Given two positive integers A and B (A is a divisor and B is a dividend, as dividend and divisor. Output the integer result of A / B. Please compute the result without using multiplication (*), division (/) and mod(%) operator. Note: 1. The integer division should truncate toward zero, which means losing its fractional part. 2. Divisor cannot be the zero and the output must be a number.
最新发布
06-01
To solve this problem, we can use repeated subtraction to find how many times the divisor can be subtracted from the dividend without going below zero. This will give us the integer result of the division. Here's the code in Python: ``` def divide(divisor, dividend): if divisor == 0: return None # Divisor cannot be zero if dividend == 0: return 0 # Dividend is zero, so result is zero # determine sign of the result negative = (divisor < 0) ^ (dividend < 0) # convert to positive numbers divisor = abs(divisor) dividend = abs(dividend) quotient = 0 while dividend >= divisor: dividend -= divisor quotient += 1 # restore sign of the result if negative: quotient = -quotient return quotient ``` In this code, we first check if the divisor is zero, which is not allowed. If the dividend is zero, then the result is zero. We also determine the sign of the result by checking if the divisor and dividend have different signs. We then convert both the divisor and dividend to positive numbers to simplify the repeated subtraction. We use a while loop to subtract the divisor from the dividend until we can no longer do so without going below zero. We keep track of how many times we subtracted the divisor, which is the integer result of the division. Finally, we restore the sign of the result if necessary and return it. This code should work for any positive integers A and B, as long as A is not zero.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值