LeetCode 029 Divide Two Integers

最新推荐文章于 2021-01-04 14:14:43 发布

_我们的存在

最新推荐文章于 2021-01-04 14:14:43 发布

阅读量463

点赞数 1

分类专栏： leetcode LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/Yano_nankai/article/details/49684757

版权

leetcode 同时被 2 个专栏收录

208 篇文章 0 订阅

订阅专栏

LeetCode

80 篇文章 3 订阅

订阅专栏

题目描述

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

If it is overflow, return MAX_INT.

代码

    public int divide(int dividend, int divisor) {

        if (divisor == 0) {
            return Integer.MAX_VALUE;
        }

        int result = 0;

        if (dividend == Integer.MIN_VALUE) {
            result = 1;
            if (divisor == -1) {
                return Integer.MAX_VALUE;
            }
            dividend += Math.abs(divisor);
        }

        if (divisor == Integer.MIN_VALUE) {
            return result;
        }

        boolean isNeg = ((dividend ^ divisor) >>> 31 == 1) ? true : false;

        dividend = Math.abs(dividend);
        divisor = Math.abs(divisor);

        int c = 0;
        while (divisor <= (dividend >> 1)) {
            divisor <<= 1;
            c++;
        }

        while (c >= 0) {
            if (dividend >= divisor) {
                dividend -= divisor;
                result += 1 << c;
            }
            divisor >>= 1;
            c--;
        }

        System.out.println(result);

        return isNeg ? -result : result;
    }