feat: add solutions to lc problem: No.1810

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This pull request adds solutions to LeetCode problem No. 1810 "Minimum Path Cost in a Hidden Grid", an interactive problem requiring the use of DFS for graph exploration combined with Dijkstra's algorithm to find the minimum cost path.

Key Changes:

• Solutions implemented in multiple programming languages (Python, Java, C++, JavaScript)
• README documentation added in both Chinese and English
• Algorithms use DFS to explore the hidden grid and Dijkstra's algorithm to compute minimum path cost

Reviewed changes

Copilot reviewed 6 out of 6 changed files in this pull request and generated no comments.

Show a summary per file

Unfortunately, no diff files were available in the review context. The PR appears to add new solution files for problem 1810, but the actual changes were not provided for detailed review. Based on the repository structure, the following files are expected to be added:

File	Description
Solution.py	Python implementation using DFS + Dijkstra's algorithm
Solution.java	Java implementation using DFS + Dijkstra's algorithm
Solution.cpp	C++ implementation using DFS + Dijkstra's algorithm
Solution.js	JavaScript implementation using DFS + Dijkstra's algorithm
README.md	Chinese problem description and solution explanation
README_EN.md	English problem description and solution explanation

Note: No specific code issues could be identified as the diff content was not available for review in this context.

---

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