###### Middle-题目127：29. Divide Two Integers

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

If it is overflow, return MAX_INT.

public class Solution {
public int divide(int dividend, int divisor) {
return (dividend==-2147483648 && divisor == -1)?Integer.MAX_VALUE:dividend/divisor;
}
}

2ms,beats 75.64%,众数3ms,66.70%
Cmershen的碎碎念：

#### LeetCode --- 29. Divide Two Integers

2015-02-02 21:58:27

#### LeetCode29DivideTwoIntegers--In Java

2016-02-22 20:24:54

#### [Leetcode]29. Divide Two Integers @python

2016-01-16 16:48:08

#### LeetCode(29)Divide Two Integers

2014-01-03 07:24:18

#### LeetCode 29 Divide Two Integers (C,C++,Java,Python)

2015-05-13 09:27:20

#### [LeetCode]29.Divide Two Integers

2015-01-25 10:41:25

#### [LeetCode29]Divide Two Integers

2014-06-12 01:32:14

#### LeetCode 29 Divide Two Integers 除法的原理

2015-08-22 22:19:59

#### LeetCode 29 Divide Two Integers（两个整数相除）（*）

2015-11-17 20:04:53

#### 【LeetCode-面试算法经典-Java实现】【029-Divide Two Integers（两个整数相除）】

2015-07-25 08:12:27

## 不良信息举报

Middle-题目127：29. Divide Two Integers