#Leetcode# 29. Divide Two Integers

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了#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.

代码：

class Solution {
public:
  long long divide(long long dividend, long long divisor) {
    return min(2147483647LL ,dividend / divisor);
  }
};

以上是关于#Leetcode# 29. Divide Two Integers的主要内容，如果未能解决你的问题，请参考以下文章