feat: update solutions for lc No.0085

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This pull request updates the solution implementations for LeetCode problem 85 "Maximal Rectangle". The problem involves finding the largest rectangle containing only '1's in a binary matrix.

Changes:

• Updates solution implementations across multiple programming languages (Python, Java, C++, Go, TypeScript, Rust, C#)
• Uses monotonic stack algorithm to solve the problem by treating each row as a histogram base
• Includes comprehensive documentation in both Chinese and English explaining the algorithm

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
Solution.py	Python implementation using two-pass monotonic stack approach
Solution.java	Java implementation using single-pass monotonic stack with ArrayDeque
Solution.cpp	C++ implementation using single-pass monotonic stack with std::stack
Solution.go	Go implementation using single-pass monotonic stack with slice
Solution.ts	TypeScript implementation using single-pass monotonic stack with array
Solution.rs	Rust implementation using single-pass monotonic stack with Vec
Solution.cs	C# implementation using single-pass monotonic stack with Stack
README.md	Chinese documentation explaining the algorithm and approach
README_EN.md	English documentation explaining the algorithm and approach

---

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