Divide Two Integers 两个整数相除
来源:互联网 发布:淘宝用什么快递单打印 编辑:程序博客网 时间:2024/05/16 07:59
class Solution {
public:
int divide(int dividend, int divisor) {
bool sign=(dividend<0&&divisor>0)||(dividend>0&&divisor<0);
long long a=abs((double)dividend);
long long b=abs((double)divisor);
long long ret=0;
while(a>=b)
{
long long c=b;
for(int i=0;a>=c;i++,c<<=1)
{
a-=c;
ret+=1<<i;
}
}
if(sign) return -ret;
else return ret;
}
};
public:
int divide(int dividend, int divisor) {
bool sign=(dividend<0&&divisor>0)||(dividend>0&&divisor<0);
long long a=abs((double)dividend);
long long b=abs((double)divisor);
long long ret=0;
while(a>=b)
{
long long c=b;
for(int i=0;a>=c;i++,c<<=1)
{
a-=c;
ret+=1<<i;
}
}
if(sign) return -ret;
else return ret;
}
};
0 0
- Divide Two Integers 两个整数相除
- 5.divide-two-integers(两个整数相除)
- LeetCode OJ 之 Divide Two Integers (两个整数相除)
- 【LeetCode-面试算法经典-Java实现】【029-Divide Two Integers(两个整数相除)】
- [LeetCode-29] Divide Two Integers(两个整数相除,不用乘除取余算术符)
- LeetCode 29 Divide Two Integers(两个整数相除)(*)
- Leetcode #29 Divide Two Integers 整数相除 解题报告
- leetcode 29 Divide Two Integers(整数相除)
- LeetCode | Divide Two Integers(两个数相除)
- Leetcode刷题记——29. Divide Two Integers(整数相除Divide two integers without using multiplication, division)
- leetCode 29.Divide Two Integers (两整数相除) 解题思路和方法
- LeetCode (31) Divide two integers (不使用 *, /, mod 求两个数相除结果)
- Divide Two Integers不使用乘除法来计算两个数相除
- Divide Two Integers 两数相除@LeetCode
- LeetCode----29. Divide Two Integers (两数相除)
- LeetCode: Divide Two Integers
- [LeetCode]Divide Two Integers
- LeetCode: Divide Two Integers
- 创建div
- Spiral Matrix II 螺旋矩阵II
- LeetCode OJ:Path Sum
- hdu 1875 最小生成树+并查集
- 1293. 3n+1数链问题
- Divide Two Integers 两个整数相除
- 我要开始记录。 从今天开始!!
- 用JS-appendChild实现学生信息录入
- HDU2112 HDU Today
- 十、短暂的春秋---与机会失之交臂的公司
- 圆检测——最小二乘法拟合圆的推导
- 自建项目记录
- GridLayout与TableLayout布局
- IOS开发之路三(XML解析之KissXML的使用)