[leetcode 29] Divide Two Integers
来源：互联网 发布：菠萝饭软件类似的软件 编辑：程序博客网 时间：2024/06/11 18:50
Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT.
class Solution {public: int divide(int dividend, int divisor) { if (dividend == INT_MIN && divisor == -1) { return INT_MAX; } if (dividend == 0) { return 0; } long long a = dividend>=0?dividend:-(long long)dividend; long long b = divisor>=0?divisor:-(long long)divisor; long long res = 0; while (a>=b) { long long c = b; for (int i = 0; a >= c; ++i, c <<= 1) { a -= c; res += 1<<i; } } return ((dividend^divisor)>>31)?-res:res; }}; 0 0
- leetcode 29: Divide Two Integers
- LeetCode(29)Divide Two Integers
- [leetcode 29] Divide Two Integers
- [leetcode] 29 Divide Two Integers
- leetcode 29 Divide Two Integers
- Leetcode 29 Divide Two Integers
- LeetCode 29 - Divide Two Integers
- leetcode 29 -- Divide Two Integers
- leetcode 29：Divide Two Integers
- leetcode 29: Divide Two Integers
- Leetcode#29 Divide Two Integers
- LeetCode(29)Divide Two Integers
- LeetCode-29 Divide Two Integers
- Leetcode#29||Divide Two Integers
- leetcode-29 Divide Two Integers
- leetcode 29:Divide Two Integers
- leetcode 29:Divide Two Integers
- LeetCode 29: Divide Two Integers
- spring传集合
- Android线程优先级
- 贝叶斯定理与朴素贝叶斯分类器
- [leetcode 3] Longest Substring Without Repeating Characters
- NYOJ 370 波动序列 (有意思的题)
- [leetcode 29] Divide Two Integers
- poj 1007 DNAsorting
- 【算法导论】二叉树的前中后序非递归遍历实现
- 自适应web
- u3d摄像机跟随
- LeetCode Add Two Numbers
- OC对象初始化－便利的初始化方法
- 再看数据库——（5）Group By与Order By
- 使用""还是构造器来创建字符串
