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 }}
lhcxx
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
/
MaxConsecutiveOnesII.java
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
46 lines (43 loc) · 1.53 KB
master
Breadcrumbs
Leetcode-Java
/
leetcode
/
solution
/
src
/
MaxConsecutiveOnesII.java
Copy path
Top
File metadata and controls
Code
Blame
46 lines (43 loc) · 1.53 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
41
42
43
44
45
46
import
java
.
util
.
LinkedList
;
import
java
.
util
.
Queue
;
public
class
MaxConsecutiveOnesII
{
/**
* 这题思路是维护一个窗口[l,h]
* 这个窗口满足条件为0的个数小于等于k,这样这些0都能翻转成1,窗口的大小就是连续的1的个数了
* 如果遇到一个新的0,要判断当前窗口的0是否超了,如果超了,则窗口左边要收缩直到0的个数仍小于等于k为止
*/
public
int
findMaxConsecutiveOnes
(
int
[]
nums
,
int
k
) {
int
max
=
0
,
zero
=
0
;
for
(
int
l
=
0
,
h
=
0
;
h
<
nums
.
length
;
h
++) {
if
(
nums
[
h
] ==
0
) {
zero
++;
}
while
(
zero
>
k
) {
if
(
nums
[
l
++] ==
0
) {
zero
--;
}
}
max
=
Math
.
max
(
max
,
h
-
l
+
1
);
}
return
max
;
}
/**
* for follow up
* follow up的意思是说这是个数据流,不能像上面那样随机访问元素
* 这里用一个队列保存0元素的index,当新来一个0使得队列的size超过k时,队列要poll一个0
*/
public
int
findMaxConsecutiveOnes2
(
int
[]
nums
,
int
k
) {
int
max
=
0
;
Queue
<
Integer
>
zeroIndex
=
new
LinkedList
<>();
for
(
int
l
=
0
,
h
=
0
;
h
<
nums
.
length
;
h
++) {
if
(
nums
[
h
] ==
0
) {
zeroIndex
.
offer
(
h
);
}
if
(
zeroIndex
.
size
() >
k
) {
l
=
zeroIndex
.
poll
() +
1
;
}
max
=
Math
.
max
(
max
,
h
-
l
+
1
);
}
return
max
;
}
}
You can’t perform that action at this time.