GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — LeetCode_algorithm/DivideTwoIntegers.java at master · rpj911/LeetCode_algorithm

Expand file tree

/

DivideTwoIntegers.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
24 lines (20 loc) · 633 Bytes
/

DivideTwoIntegers.java

Copy path

File metadata and controls

24 lines (20 loc) · 633 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
package Algorithms;
public class DivideTwoIntegers {
public static void main(String[] args) {
System.out.println(divide(-2147483648, 1));
}
public static int divide(int dividend, int divisor) {
long a = Math.abs((long)dividend);
long b = Math.abs((long)divisor);
int ret = 0;
while (a >= b) {
long bTmp = b;
int cnt = 1;
for (int i = 1; a >= bTmp; cnt <<= 1, bTmp <<= 1) {
a -= bTmp;
ret += cnt;
}
}
return ((dividend > 0) ^ (divisor > 0)) ? -ret: ret;
}
}
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.