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 }}
Jinglin-LI
Leetcode
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Leetcode
/
DivideTwoIntegers.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
39 lines (36 loc) · 1.62 KB
master
Breadcrumbs
Leetcode
/
DivideTwoIntegers.java
Copy path
Top
File metadata and controls
Code
Blame
39 lines (36 loc) · 1.62 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
/*
Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT.
*/
/*
最直观的方法是,用被除数逐个的减去除数,直到被除数小于0。这样做会超时。
那么如果每次不仅仅减去1个除数,计算速度就会增加,
但是题目不能使用乘法,因此不能减去k*除数,我们可以对除数进行左移位操作,
这样每次相当于减去2^k个除数,
如何确定k呢,只要使 (2^k)*除数 <= 当前被除数 <(2^(k+1))*除数.
http://www.cnblogs.com/TenosDoIt/p/3795342.html
这里必须将原来的dividend和divisor转化成unsigned long long类型。不然divisor左移时可能会变成负数从而陷入死循环。
*/
public
class
Solution
{
public
int
divide
(
int
dividend
,
int
divisor
) {
if
(
divisor
==
0
)
return
Integer
.
MAX_VALUE
;
if
(
dividend
==
0
)
return
0
;
if
(
divisor
==
1
)
return
dividend
;
if
(
divisor
== -
1
)
return
dividend
==
Integer
.
MIN_VALUE
?
Integer
.
MAX_VALUE
: -
dividend
;
boolean
neg
= ((
dividend
<
0
&&
divisor
>
0
) || (
dividend
>
0
&&
divisor
<
0
));
long
ldividend
=
Math
.
abs
((
long
)
dividend
);
long
ldivisor
=
Math
.
abs
((
long
)
divisor
);
int
res
=
0
;
for
(
int
bit
=
Integer
.
SIZE
-
1
;
bit
>=
0
&&
ldividend
>=
ldivisor
;
bit
--) {
if
(
ldividend
>= (
ldivisor
<<
bit
)) {
res
+=
1
<<
bit
;
// add the "1" in the certain bit
ldividend
-=
ldivisor
<<
bit
;
}
}
return
neg
? -
res
:
res
;
}
}
You can’t perform that action at this time.