feat: add solutions to lc problem: No.3946

[yanglbme]

No description provided.

[Copilot]

Pull request overview

Adds multi-language reference solutions and accompanying write-ups for LeetCode 3946. Maximum Number of Items From Sale I, expanding the repository’s problem coverage in the 3900–3999 range.

Changes:

• Added implementations of the DP (0-1 knapsack) approach in TypeScript, Python, Java, Go, and C++.
• Expanded Chinese and English READMEs with the algorithm explanation, complexity analysis, and code tabs.

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/3900-3999/3946.Maximum Number of Items From Sale I/Solution.ts	Adds TypeScript implementation of the DP + cheapest-fill approach.
solution/3900-3999/3946.Maximum Number of Items From Sale I/Solution.py	Adds Python implementation of the same solution strategy.
solution/3900-3999/3946.Maximum Number of Items From Sale I/Solution.java	Adds Java implementation of the same solution strategy.
solution/3900-3999/3946.Maximum Number of Items From Sale I/Solution.go	Adds Go implementation of the same solution strategy.
solution/3900-3999/3946.Maximum Number of Items From Sale I/Solution.cpp	Adds C++ implementation of the same solution strategy.
solution/3900-3999/3946.Maximum Number of Items From Sale I/README.md	Adds Chinese solution explanation + multi-language code tabs.
solution/3900-3999/3946.Maximum Number of Items From Sale I/README_EN.md	Adds English solution explanation + multi-language code tabs.

---

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