029 - Divide Two Integers

最新推荐文章于 2020-09-10 16:07:30 发布

shuimuyq

最新推荐文章于 2020-09-10 16:07:30 发布

阅读量204

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/shuimuyq/article/details/49785169

版权

leetcode 专栏收录该内容

70 篇文章 0 订阅

订阅专栏

Divide two integers without using multiplication, division and mod operator.

If it is overflow, return MAX_INT.

实现两个整数相除，不能使用乘，除，模运算

int divide(int dividend, int divisor) 
{
	if (dividend == INT_MIN) {
		if (divisor == -1 || divisor == 0) return INT_MAX;
		if (divisor == INT_MIN) return 1;
	}
	if (divisor == INT_MIN) return 0;

	int flag, remain = 0, result = 0, o = 1;

	if (dividend < 0 && divisor > 0 || dividend > 0 && divisor < 0) 
		o = -1;
	flag = divisor < 0? -divisor : divisor;
	if (dividend == INT_MIN) {
		dividend += flag;
		result += 1;
	}
	if (dividend < 0) dividend = -dividend;

	int i, f;
	while (dividend > 0) {
		f = 0;
		for (i = 0;dividend >= flag; i++) {
			f = (flag << i);
			if (f >= dividend || f < 0) break;
		}
		if (f > dividend || f < 0) i -= 1;
		result += 1 << i;
		dividend -= flag << i;
		if (dividend < 0) remain = 1;
	}

	if (remain) result -= 1;
	return o * result;
}