feat: add solutions for lc No.3600

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This PR adds solutions for LeetCode problem 3600 "Maximize Spanning Tree Stability with Upgrades" (Hard, Weekly Contest 456 Q4) in five languages. The solution uses binary search on the answer combined with Union-Find to verify feasibility of a given stability threshold.

Changes:

• Added solutions in Python, Java, C++, Go, and TypeScript using a binary search + Union-Find approach
• Added bilingual README files (English and Chinese) with problem description, examples, constraints, and solution explanation

Reviewed changes

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

Show a summary per file

File	Description
Solution.py	Python solution using UnionFind class with binary search on stability
Solution.java	Java solution with same algorithm, using instance fields for state
Solution.cpp	C++ solution using unite method naming to avoid keyword conflict
Solution.go	Go solution using package-level globals for check helper access
Solution.ts	TypeScript solution using module-level variables for check helper
README.md	Chinese problem description and solution explanation
README_EN.md	English problem description and solution explanation

---

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

You can also share your feedback on Copilot code review. Take the survey.