Conversation
idoocs
added
core team
There was a problem hiding this comment.
Pull request overview
Updates the LeetCode 2541 solution implementations and documentation to use a “balance increases vs decreases” single-pass approach for computing the minimum operations, and also removes an extra Rust solution variant for LeetCode 2540.
Changes:
- Reworked LC 2541 solutions (C/C++/Go/Java/Python/Rust/TypeScript) to accumulate required
+kand-koperation counts and validate feasibility via balance. - Updated LC 2541 Chinese/English READMEs to match the revised approach and code.
- Removed LC 2540 Rust “Solution2” and its README sections.
Reviewed changes
Copilot reviewed 12 out of 12 changed files in this pull request and generated 3 comments.
Show a summary per file
| File | Description |
|---|---|
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/Solution.ts | Rewrites TS implementation to track positive/negative operation counts. |
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/Solution.rs | Rewrites Rust implementation to track positive/negative operation counts. |
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/Solution.py | Rewrites Python implementation to track positive/negative operation counts. |
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/Solution.java | Rewrites Java implementation to track positive/negative operation counts. |
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/Solution.go | Rewrites Go implementation to track positive/negative operation counts and removes abs helper. |
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/Solution.cpp | Rewrites C++ implementation to track positive/negative operation counts. |
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/Solution.c | Rewrites C implementation to track positive/negative operation counts. |
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README.md | Updates CN explanation and code snippets to the new approach. |
| solution/2500-2599/2541.Minimum Operations to Make Array Equal II/README_EN.md | Updates EN explanation and code snippets to the new approach. |
| solution/2500-2599/2540.Minimum Common Value/Solution2.rs | Deletes the second Rust solution implementation. |
| solution/2500-2599/2540.Minimum Common Value/README.md | Removes the “方法二 / Rust” section corresponding to the deleted file. |
| solution/2500-2599/2540.Minimum Common Value/README_EN.md | Removes the “Solution 2 / Rust” section corresponding to the deleted file. |
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
| if (diff % k !== 0) { | ||
| let [a, b] = [0, 0]; | ||
| for (let i = 0; i < nums1.length; ++i) { | ||
| const [x, y] = [nums1[i], nums2[i]]; |
Comment on lines
213
to
217
| <!-- tabs:end --> | ||
|
|
||
| <!-- solution:end --> | ||
|
|
||
| <!-- solution:start --> | ||
|
|
||
| ### 方法二 | ||
|
|
||
| <!-- tabs:start --> | ||
|
|
||
| #### Rust | ||
|
|
||
| ```rust | ||
| impl Solution { | ||
| pub fn get_common(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 { | ||
| let mut iter1 = nums1.iter(); | ||
| let mut iter2 = nums2.iter(); | ||
| let mut num1 = iter1.next(); | ||
| let mut num2 = iter2.next(); | ||
|
|
||
| while let (Some(n1), Some(n2)) = (num1, num2) { | ||
| if n1 == n2 { | ||
| return *n1; | ||
| } else if n1 < n2 { | ||
| num1 = iter1.next(); | ||
| } else { | ||
| num2 = iter2.next(); | ||
| } | ||
| } | ||
|
|
||
| -1 | ||
| } | ||
| } | ||
| ``` | ||
|
|
||
| <!-- tabs:end --> | ||
|
|
||
| <!-- solution:end --> | ||
|
|
||
| <!-- problem:end --> |
Comment on lines
213
to
217
| <!-- tabs:end --> | ||
|
|
||
| <!-- solution:end --> | ||
|
|
||
| <!-- solution:start --> | ||
|
|
||
| ### Solution 2 | ||
|
|
||
| <!-- tabs:start --> | ||
|
|
||
| #### Rust | ||
|
|
||
| ```rust | ||
| impl Solution { | ||
| pub fn get_common(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 { | ||
| let mut iter1 = nums1.iter(); | ||
| let mut iter2 = nums2.iter(); | ||
| let mut num1 = iter1.next(); | ||
| let mut num2 = iter2.next(); | ||
|
|
||
| while let (Some(n1), Some(n2)) = (num1, num2) { | ||
| if n1 == n2 { | ||
| return *n1; | ||
| } else if n1 < n2 { | ||
| num1 = iter1.next(); | ||
| } else { | ||
| num2 = iter2.next(); | ||
| } | ||
| } | ||
|
|
||
| -1 | ||
| } | ||
| } | ||
| ``` | ||
|
|
||
| <!-- tabs:end --> | ||
|
|
||
| <!-- solution:end --> | ||
|
|
||
| <!-- problem:end --> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
No description provided.