29. Divide Two Integers

最新推荐文章于 2022-05-31 11:11:52 发布

原创最新推荐文章于 2022-05-31 11:11:52 发布 · 132 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

59 篇文章

订阅专栏

本文介绍了一种不使用乘法、除法和取余运算来实现两个整数相除的方法。通过位移和累加实现了高效计算，并处理了溢出情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 (divisor == 0 || dividend == 0) return 0;

		bool negative = (dividend < 0) ^ (divisor < 0);
		long long count;
		long long fianlCount = 0;
		long long a = abs(dividend);
		long long b = abs(divisor);
		while (a >= b)
		{
			count = 1;
			long long  sum = b;
			while (sum + sum <= a)
			{
				sum += sum;
				count += count;
			}
			a -= sum;
			fianlCount += count;
		}
		if (negative)
		{
			return 0 - fianlCount;
		}
		else
		{   
            if (fianlCount> INT_MAX) return INT_MAX ;
			return fianlCount;
		};
	}
private:
	long long abs(int num)
	{
		long long ans;
		if (num < 0)
		{
			ans = num;  
			return 0- ans;
		}
		else
			return  (long long)num;
	}
};