Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

[pull] master from wisdompeak:master #345

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pull merged 5 commits into AlgorithmAndLeetCode:master from wisdompeak:master
Aug 6, 2025
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Create Readme.md
  • Loading branch information
wisdompeak authored Aug 6, 2025
commit b074f12d476d2bb7e162a1f2024af908a8e6b5e7
7 changes: 7 additions & 0 deletions Two_Pointers/3641.Longest-Semi-Repeating-Subarray/Readme.md
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
### 3641.Longest-Semi-Repeating-Subarray

非常明显的双指针,但是滑窗右边界j的控制需要格外小心。

对于任意的左边界i,当满足`while (j+1<n && count<=k)`时(count统计repeat元素的个数),可以将nums[++j]加入统计。如果循环退出,注意有两种情况:
1. 如果count>k,那么意味着j超出了合法的范围,合法subarray的长度最多是`j-i`.
2. 如果count<=k,那么意味着j已经到了最后一个元素(即n-1)但是仍未超出合法范围,故此时合法subarray的长度是`j-i+1`.

AltStyle によって変換されたページ (->オリジナル) /