Skip to content

feat: add solutions to lc problems: No.4010~4012 - #5334

Merged
yanglbme merged 1 commit into
mainfrom
dev
Aug 2, 2026
Merged

feat: add solutions to lc problems: No.4010~4012#5334
yanglbme merged 1 commit into
mainfrom
dev

Conversation

@yanglbme

@yanglbme yanglbme commented Aug 2, 2026

Copy link
Copy Markdown
Member

No description provided.

Co-authored-by: Cursor <cursoragent@cursor.com>
Copilot AI review requested due to automatic review settings August 2, 2026 11:52
@cursor

cursor Bot commented Aug 2, 2026

Copy link
Copy Markdown

Bugbot is not enabled for your account, so this pull request was not reviewed.

Enable Bugbot in the Cursor dashboard to get automatic reviews on future PRs.

@yanglbme
yanglbme merged commit 223278f into main Aug 2, 2026
8 checks passed
@yanglbme
yanglbme deleted the dev branch August 2, 2026 11:53

Copilot AI left a comment

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Pull request overview

This PR adds new LeetCode solutions for problems 4010–4012 to the repository, including multi-language implementations and updated Chinese/English READMEs with explanations and code tabs.

Changes:

  • Added solution implementations for LC 4010, 4011, and 4012 in TypeScript / Python / Java / Go / C++.
  • Expanded README.md and README_EN.md for each problem with solution explanations and embedded code.
  • Standardized most languages on integer-safe comparisons for ratio checks (but one Python snippet currently diverges—see comments).

Reviewed changes

Copilot reviewed 21 out of 21 changed files in this pull request and generated 3 comments.

Show a summary per file
File Description
solution/4000-4099/4012.Count of Unfinished Tasks After Each Shift/Solution.ts Adds TypeScript solution implementation
solution/4000-4099/4012.Count of Unfinished Tasks After Each Shift/Solution.py Adds Python solution implementation
solution/4000-4099/4012.Count of Unfinished Tasks After Each Shift/Solution.java Adds Java solution implementation
solution/4000-4099/4012.Count of Unfinished Tasks After Each Shift/Solution.go Adds Go solution implementation
solution/4000-4099/4012.Count of Unfinished Tasks After Each Shift/Solution.cpp Adds C++ solution implementation
solution/4000-4099/4012.Count of Unfinished Tasks After Each Shift/README.md Adds CN explanation + multi-language code tabs (incl. TS)
solution/4000-4099/4012.Count of Unfinished Tasks After Each Shift/README_EN.md Adds EN explanation + multi-language code tabs (incl. TS)
solution/4000-4099/4011.Count Subarrays With Even Odd Ratio I/Solution.ts Adds TypeScript solution implementation
solution/4000-4099/4011.Count Subarrays With Even Odd Ratio I/Solution.py Adds Python solution implementation
solution/4000-4099/4011.Count Subarrays With Even Odd Ratio I/Solution.java Adds Java solution implementation
solution/4000-4099/4011.Count Subarrays With Even Odd Ratio I/Solution.go Adds Go solution implementation
solution/4000-4099/4011.Count Subarrays With Even Odd Ratio I/Solution.cpp Adds C++ solution implementation
solution/4000-4099/4011.Count Subarrays With Even Odd Ratio I/README.md Adds CN explanation + multi-language code tabs (incl. TS)
solution/4000-4099/4011.Count Subarrays With Even Odd Ratio I/README_EN.md Adds EN explanation + multi-language code tabs (incl. TS)
solution/4000-4099/4010.Maximize Pair Strength Using GCD/Solution.ts Adds TypeScript solution implementation
solution/4000-4099/4010.Maximize Pair Strength Using GCD/Solution.py Adds Python solution implementation
solution/4000-4099/4010.Maximize Pair Strength Using GCD/Solution.java Adds Java solution implementation
solution/4000-4099/4010.Maximize Pair Strength Using GCD/Solution.go Adds Go solution implementation
solution/4000-4099/4010.Maximize Pair Strength Using GCD/Solution.cpp Adds C++ solution implementation
solution/4000-4099/4010.Maximize Pair Strength Using GCD/README.md Adds CN explanation + multi-language code tabs (incl. TS)
solution/4000-4099/4010.Maximize Pair Strength Using GCD/README_EN.md Adds EN explanation + multi-language code tabs (incl. TS)

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.

for j in range(i, n):
y += nums[j] % 2
x = j - i + 1 - y
if y and (x / y) <= (a / b):
for j in range(i, n):
y += nums[j] % 2
x = j - i + 1 - y
if y and (x / y) <= (a / b):
for j in range(i, n):
y += nums[j] % 2
x = j - i + 1 - y
if y and (x / y) <= (a / b):
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants