Divide Two Integers

最新推荐文章于 2019-11-30 11:08:51 发布

原创最新推荐文章于 2019-11-30 11:08:51 发布 · 657 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

Other Algorithms 同时被 2 个专栏收录

66 篇文章

订阅专栏

Medium

29 篇文章

订阅专栏

本文提供了一种方法，在不使用乘法、除法和取模操作的情况下，实现两个整数的除法运算。通过将被除数表示为除数的幂次之和，利用位移和减法操作进行计算。

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

dividend = divisor*2^0 + divisor*2^1 + ... + divisor*2^n + mod; (mod<divisor).

public class Solution {
    public int divide(int dividend, int divisor) {
		// Start typing your Java solution below
		// DO NOT write main() function
		if(dividend == 0 || divisor == 0)
			return 0;
		int sign = 1;
		if(dividend < 0)
			sign = -sign;
		if(divisor < 0)
			sign = -sign;
		long dd;
		long dr;
		if(dividend == Integer.MIN_VALUE)
			dd = (long)Integer.MAX_VALUE + 1;
		else
			dd = Math.abs(dividend);
		if(divisor == Integer.MIN_VALUE)
			dr = (long)Integer.MAX_VALUE + 1;
		else
			dr = Math.abs(divisor);
		long count = 1;
		long num = dr;
		while(num < dd){
			num <<= 1;
			count <<= 1;
		}
		int result = 0;
		while(num >= dr){
			while(dd >= num){
				dd -= num;
				result += count;
			}
			num >>= 1;
			count >>= 1;
		}
		if(sign < 0)
			return -result;
		else
			return result;
	}
}