Skip to content
Navigation Menu
Sign in
Products
Platform
GitHub
Repository hosting, code review, and collaboration
Copilot
AI coding agent for tasks, projects, and automated work
Build & Ship
Actions
CI/CD and automation
Code Quality
Quality analysis, fixes, and enforcement
Codespaces
Cloud development environments
Secure
Code Security
Vulnerability detection and remediation
Secret Protection
Secret scanning and leak prevention
All Features
Developers
Learn
Documentation
Training
Certifications
Build
Build with Copilot
Customize Copilot
Integrations
Explore
Trending repos
GitHub Sponsors
Developer articles
Changelog
Changelog
Your source for the latest features, improvements, and fixes across GitHub products, all in one place.
Businesses
By Stage
Enterprises
Team
Startups
Nonprofits
By Industry
Healthcare
Financial services
Manufacturing
Government
See all industries
Evaluate GitHub
Why GitHub
Customer Stories
Business insights
Trust Center
Add-ons
GitHub Advanced Security
Enterprise-grade code security
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Resources
Learn & Connect
Documentation
Resource center
Blog
Events & webinars
Community Forum
Customer Stories
Integrations
Support
Customer support
Training
GitHub Status
Company
About
Partners
Changelog
GitHub Universe
GitHub Universe
The event for developers, by developers — talks, workshops, and what’s next for GitHub.
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
Larixiel
Leetcode-Java
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
DivideTwoIntegers.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
40 lines (36 loc) · 1.29 KB
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
DivideTwoIntegers.java
Copy path
Top
File metadata and controls
Code
Blame
40 lines (36 loc) · 1.29 KB
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
30
31
32
33
34
35
36
37
38
39
40
public
class
DivideTwoIntegers
{
/**
* 这题思路是除数不断减去被除数,然后累加1,一直减到除数小于被除数为止
* 如果被除数很小这样会超时,复杂度为O(n)
*/
/**
* 可以进行优化,先减去被除数的1倍,再减去被除数的2倍,再减被除数的4倍,8倍....
* 直到减不了了,再从头开始,从被除数的1倍开始减
*/
/**
* 要注意的地方,一个是溢出,一个是返回结果的符号
*/
public
int
divide
(
int
dividend
,
int
divisor
) {
/**
* 这里都先转成long,以免后面溢出
*/
long
a
=
dividend
>=
0
?
dividend
: -
1
* (
long
)
dividend
;
long
b
=
divisor
>=
0
?
divisor
: -
1
* (
long
)
divisor
;
long
result
=
0
;
while
(
a
>=
b
) {
long
c
=
b
;
for
(
int
i
=
0
;
a
>=
c
; ++
i
,
c
<<=
1
) {
a
-=
c
;
result
+=
1
<<
i
;
}
}
/**
* 这里是判断两个数的符号位,如果不一样说明结果为负
*/
result
*= ((
dividend
^
divisor
) >>>
31
) !=
0
? -
1
:
1
;
/**
* 如果溢出则返回整数最大值
*/
return
result
>
Integer
.
MAX_VALUE
?
Integer
.
MAX_VALUE
: (
int
)
result
;
}
}
You can’t perform that action at this time.