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 }}
tygc
Leetcode-Java
Repository navigation
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
More
items
Files
Expand file tree
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
FindTheDuplicateNumber.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
39 lines (33 loc) · 1.43 KB
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
FindTheDuplicateNumber.java
Copy path
Top
File metadata and controls
Code
Blame
39 lines (33 loc) · 1.43 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
/**
* 题目的意思是有n+1个数,这些数的范围限定在[1,n],其中只有一个重复数,重复的次数不限
*/
public
class
FindTheDuplicateNumber
{
/**
* 这道题涉及木桶原理,如果元素个数比桶多,说明有些桶里装了多个元素。
* 一共迭代lgn次,每次O(n),因此时间复杂度O(nlgn),空间O(l)
*/
public
int
findDuplicate
(
int
[]
nums
) {
int
min
=
1
,
max
=
nums
.
length
-
1
;
while
(
min
<
max
) {
int
mid
= (
min
+
max
) /
2
;
int
count
=
0
;
for
(
int
i
=
0
;
i
<
nums
.
length
;
i
++) {
if
(
nums
[
i
] <=
mid
) {
count
++;
}
}
/**
* 如果count>mid,说明元素个数count比桶数mid还大,则可以肯定重复的数在[1,mid]中
* 但是count<=mid就能确定重复的数肯定不在[1,mid]中么?不一定吧,接下来推理一下:
* 我们看右边的一半,[mid+1,n]区间的数有n+1-count个,可见元素有n+1-count个,桶有n-mid个,而count<=mid等价于count-1<mid,
* 因此元素个数大于桶数,右区间一定有重复的数,由于题目已经限定只有一个重复数,因此只能在右区间
*/
if
(
count
>
mid
) {
max
=
mid
;
}
else
{
min
=
mid
+
1
;
}
}
return
min
;
}
}
You can’t perform that action at this time.