Skip to content

feat: add solutions for lc No.3919#5185

Merged
yanglbme merged 1 commit intomainfrom
dev
May 3, 2026
Merged

feat: add solutions for lc No.3919#5185
yanglbme merged 1 commit intomainfrom
dev

Conversation

@yanglbme
Copy link
Copy Markdown
Member

@yanglbme yanglbme commented May 3, 2026

No description provided.

Copilot AI review requested due to automatic review settings May 3, 2026 13:24
@idoocs idoocs added core team Issues or pull requests from core team cpp Issues or Pull requests relate to .cpp code go Issues or Pull requests relate to .go code java Issues or Pull requests relate to .java code md Issues or Pull requests relate to .md files py Issues or Pull requests relate to .py code ts Issues or Pull requests relate to .ts code labels May 3, 2026
@yanglbme yanglbme merged commit 8415a7e into main May 3, 2026
16 checks passed
@yanglbme yanglbme deleted the dev branch May 3, 2026 13:25
Copy link
Copy Markdown

Copilot AI left a comment

Choose a reason for hiding this comment

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

Pull request overview

Adds multi-language reference implementations for LeetCode 3919 (“Minimum Cost to Move Between Indices”) to the repository’s solutions catalog.

Changes:

  • Added solution implementations in Python, Java, C++, Go, and TypeScript for problem 3919.
  • Updated both Chinese and English READMEs to include the new code snippets for all supported languages.

Reviewed changes

Copilot reviewed 7 out of 7 changed files in this pull request and generated 2 comments.

Show a summary per file
File Description
solution/3900-3999/3919.Minimum Cost to Move Between Indices/Solution.py Adds Python implementation for query answering via precomputed directional prefix costs.
solution/3900-3999/3919.Minimum Cost to Move Between Indices/Solution.java Adds Java implementation of the same approach.
solution/3900-3999/3919.Minimum Cost to Move Between Indices/Solution.cpp Adds C++ implementation of the same approach.
solution/3900-3999/3919.Minimum Cost to Move Between Indices/Solution.go Adds Go implementation of the same approach.
solution/3900-3999/3919.Minimum Cost to Move Between Indices/Solution.ts Adds TypeScript implementation of the same approach.
solution/3900-3999/3919.Minimum Cost to Move Between Indices/README.md Populates solution code sections (CN) with the added implementations.
solution/3900-3999/3919.Minimum Cost to Move Between Indices/README_EN.md Populates solution code sections (EN) with the added implementations.

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

Comment on lines 100 to +103
#### Python3

```python

class Solution:
Comment on lines 102 to +107
#### Python3

```python

class Solution:
def minCost(self, nums: list[int], queries: list[list[int]]) -> list[int]:
n = len(nums)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

core team Issues or pull requests from core team cpp Issues or Pull requests relate to .cpp code go Issues or Pull requests relate to .go code java Issues or Pull requests relate to .java code md Issues or Pull requests relate to .md files py Issues or Pull requests relate to .py code ts Issues or Pull requests relate to .ts code

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants