leet code -- Divide Two Integers
来源:互联网 发布:第五届淘宝村高峰论坛 编辑:程序博客网 时间:2024/05/14 22:46
Q: Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT.
分析:设被除数为p,除数为q.则有:
p = q * (1+2+4+...+ 2^(exp2-1)) + new_p
每一轮循环除数翻倍增加:q=q+q,p=p-q直到最后的p小于除数q,此时被除数还剩new_p.
将(new_p,q)进行递归操作.
递归的出口是:p=0.
注意:需要注意的是,int类型范围是[-2^31, 2^31-1],最高位为补码形式符号位!
当被除数p=-2^(31)=0x1<<31时,divide(-2^31, -1) = 2^31 - 1!! 0x1<<31默认int类型,值为-2^31.
class Solution {public: int divide(long long dividend, long long divisor) { int exp2 = 0; long long ret; long long p = abs(dividend), q = abs(divisor); if(p < q) //递归出口 return 0; while(p - q >= 0){ p -= q; q = q + q; exp2++; } ret = divide(p, abs(divisor)); //figure out new_p ret += (0x1 << exp2) - 1; if(dividend < 0 && divisor > 0 || dividend > 0 && divisor < 0) ret = -ret; if(ret >= (unsigned int)(0x1<<31)) --ret; return ret; }};
0 0
- leet code -- Divide Two Integers
- CODE 104: Divide Two Integers
- LeetCode: Divide Two Integers
- [LeetCode]Divide Two Integers
- LeetCode: Divide Two Integers
- [LeetCode] Divide Two Integers
- Divide Two Integers
- Divide Two Integers
- LeetCode28:Divide Two Integers
- [Leetcode] Divide Two Integers
- LeetCode Divide Two Integers
- Divide Two Integers
- 【leetcode】Divide Two Integers
- Divide Two Integers
- Divide Two Integers
- [LeetCode]Divide Two Integers
- Divide Two Integers
- LeetCode-Divide Two Integers
- 第17周项目2--传地址值的方法
- 《最牛精准数据库》不加群提取群成员 ——本地离线92GB数据库
- 归并排序
- xftp工具连接aix ftp服务时目录项中出现空格的解决办法。
- Android之线程池深度剖析
- leet code -- Divide Two Integers
- xUtils使用说明
- AsyncTask测试多任务
- 关于inline关键字导致的 unresolved external symbol问题
- 让并发和容错更容易:Akka示例教程
- 集合框架概要
- 空间域图像增强
- HDU2710(素数打表)
- LKT5102KEY 32位CPU高速软件加密锁