feat: update solutions for lc No.1266

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This pull request updates the solutions for LeetCode problem 1266 "Minimum Time Visiting All Points". The problem requires calculating the minimum time to visit all points on a 2D plane in order, where diagonal movement is allowed.

Changes:

• Updated solution implementations across multiple programming languages
• Maintained consistent algorithm approach using the max(dx, dy) formula
• Updated documentation in both Chinese (README.md) and English (README_EN.md)

Reviewed changes

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

Show a summary per file

File	Description
README.md	Chinese documentation with problem description and solutions
README_EN.md	English documentation with problem description and solutions
Solution.py	Python implementation using pairwise iteration
Solution.java	Java implementation with iterative approach
Solution.cpp	C++ implementation with iterative approach
Solution.go	Go implementation with custom abs helper function
Solution.ts	TypeScript implementation with iterative approach
Solution.rs	Rust implementation with iterative approach
Solution.c	C implementation with macro-based max function

---

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