feat: add solutions for lc No.0401

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This PR adds TypeScript and Rust solutions for LeetCode problem #401 (Binary Watch). The implementation replaces the previous recursive approach with more efficient enumeration-based solutions, and adds corresponding documentation updates explaining both solution approaches.

Changes:

• Refactored existing Solution.ts and Solution.rs files with simpler enumeration-based implementations
• Added new Solution2.ts and Solution2.rs files implementing binary enumeration approach
• Updated documentation (README.md and README_EN.md) with detailed explanations of both solution methods

Reviewed changes

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

Show a summary per file

File	Description
solution/0400-0499/0401.Binary Watch/Solution.ts	Replaced recursive solution with hour/minute enumeration approach
solution/0400-0499/0401.Binary Watch/Solution.rs	Replaced recursive solution with hour/minute enumeration approach
solution/0400-0499/0401.Binary Watch/Solution2.ts	Added new binary enumeration solution using bit manipulation
solution/0400-0499/0401.Binary Watch/Solution2.rs	Added new binary enumeration solution using built-in count_ones
solution/0400-0499/0401.Binary Watch/README.md	Added explanations and code examples for both solutions in Chinese
solution/0400-0499/0401.Binary Watch/README_EN.md	Added explanations and code examples for both solutions in English

---

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