zoukankan      html  css  js  c++  java
  • leetcode 29. Divide Two Integers

    Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.

    Return the quotient after dividing dividend by divisor.

    The integer division should truncate toward zero.

    Example 1:

    Input: dividend = 10, divisor = 3
    Output: 3

    Example 2:

    Input: dividend = 7, divisor = -3
    Output: -2

    Note:

    • Both dividend and divisor will be 32-bit signed integers.
    • The divisor will never be 0.
    • Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 231 − 1 when the division result overflows.

    转载自:https://blog.csdn.net/lixq05/article/details/81157304

    这个思路比较清晰

    class Solution {
    public:
    long long ABS(long long a)
    {
        return a > 0 ? a : -a;
    }
    int divide(int dividend, int divisor)
    {
        if (divisor == 0 || (dividend == INT_MIN && divisor == -1))
            return INT_MAX;
        long long a = ABS((long long)dividend);
        long long b = ABS((long long)divisor);
        long long sign = ((dividend < 0) ^ (divisor < 0)) ? -1 : 1;
        long long res=0;
        long long tmp[33], times[33];
        //第一组数据填充
        tmp[0] = b;
        times[0] = 1;
        int index = 0;
        //一直填充到临界大于a的位置
        while (a >= tmp[index] && index < 33)
        {
            index++;
            tmp[index] = tmp[index - 1] + tmp[index - 1];
            times[index] = times[index - 1] + times[index - 1];
        }
        //遍历填充数据
        for (int j = index - 1; j >= 0; j--)
        {
            while (a >= tmp[j])
            {
                res += times[j];
                a -= tmp[j];
            }       
        }
        res = (sign == 1) ? res : -res;
        return (int)res;
    }
    };
  • 相关阅读:
    cf-779E (拆位)
    石子游戏 (SG函数)
    [POI2017] Flappy Bird (思维题)
    Alice and Bob (SG函数)
    Red is good (DP)
    CodeVS-1669 (背包问题)
    GalaxyOJ-468 (LCA)
    BZOJ-1191 (二分图匹配)
    Reinforcement Learning 笔记(4)
    Reinforcement Learning 笔记(3)
  • 原文地址:https://www.cnblogs.com/LUO77/p/10489489.html
Copyright © 2011-2022 走看看