Divide Two Integers

最新推荐文章于 2019-07-09 11:38:39 发布

husthg

最新推荐文章于 2019-07-09 11:38:39 发布

阅读量367

点赞数

分类专栏： LeetCode 文章标签： leetcode 二分 C++

本文链接：https://blog.csdn.net/hiz1990/article/details/40475611

版权

LeetCode 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

题目要求：

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

代码实现：

#include <iostream>
#include<vector>
#include <assert.h>

using namespace std;
class Solution {
public:
    int divide(int dividend, int divisor) {
		assert(divisor!=0);
		if(dividend==0)
			return 0;

		bool sign=true;
		if((dividend<0 && divisor>0)||(dividend>0 && divisor<0))
         <span style="white-space:pre">	</span>    sign= false;
		size_t dividend_t=abs(dividend);
		size_t divisor_t=abs(divisor);
		if(divisor_t==1)
			return sign?dividend_t:-dividend_t;

		int result=0;		
		while(divisor_t<dividend_t)
		{
			size_t temp=divisor_t;
			int count=1;
			while((temp<<=1)<dividend_t)
			{
				count<<=1;
			}
		        dividend_t=dividend_t-(temp>>=1);
			result+=count;
		}
		if(divisor_t==dividend_t)
	             result++;
		return sign?result:-result;  
    }
};
void main()
{
	Solution s;
	cout<<s.divide(2147483647,-2)<<endl;
	getchar();
}