FilesExpand file tree

 master

/

DivideTwoIntegers.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

29 lines (28 loc) · 903 Bytes

 master

/

DivideTwoIntegers.java

Top

File metadata and controls

• Code
• Blame

29 lines (28 loc) · 903 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

/*

Author: King, higuige@gmail.com

Date: Nov 18, 2014

Problem: Divide Two Integers

Difficulty: Medium

Source: https://oj.leetcode.com/problems/divide-two-integers/

Notes:

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

Solution: Use << operator.

*/

public class Solution {

public int divide(int dividend, int divisor) {

boolean flag = dividend < 0 ^ divisor < 0;

long Dividend = Math.abs((long)dividend);

long Divisor = Math.abs((long)divisor);

long res = 0;

while (Dividend >= Divisor) {

long c = Divisor;

for (int i = 0; (c << i) <= Dividend; ++i) {

Dividend -= (c << i);

res += (1 << i);

}

}

if (flag == true) res = -res;

if (res > Integer.MAX_VALUE) return Integer.MAX_VALUE;

return (int)res;

}

}