feat: add solutions to lc problem: No.1351

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This PR adds solutions to LeetCode problem 1351 "Count Negative Numbers in a Sorted Matrix", which asks to count negative numbers in a matrix sorted in non-increasing order both row-wise and column-wise.

• Implements an optimal O(m+n) time complexity solution using bottom-left corner traversal
• Provides comprehensive documentation in both English and Chinese
• Includes implementations in 7 programming languages with consistent logic

Reviewed changes

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

Show a summary per file

File	Description
README.md	Chinese documentation explaining the problem, solution approach, and complexity analysis
README_EN.md	English documentation explaining the problem, solution approach, and complexity analysis
Solution.py	Python implementation using bottom-left corner traversal algorithm
Solution.java	Java implementation using bottom-left corner traversal algorithm
Solution.cpp	C++ implementation using bottom-left corner traversal algorithm
Solution.go	Go implementation using bottom-left corner traversal algorithm
Solution.js	JavaScript implementation using bottom-left corner traversal algorithm
Solution.ts	TypeScript implementation using bottom-left corner traversal algorithm
Solution.rs	Rust implementation using bottom-left corner traversal algorithm

---

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