feat: add solutions for lc No.3821

[yanglbme]

No description provided.

[Copilot]

Pull request overview

This pull request adds solutions for LeetCode problem #3821: "Find Nth Smallest Integer With K One Bits." The problem requires finding the nth smallest positive integer that has exactly k ones in its binary representation.

Changes:

• Implements solutions using a combinatorics and greedy approach across multiple programming languages
• Adds comprehensive documentation in both English and Chinese explaining the algorithm
• Solutions utilize Pascal's triangle (binomial coefficients) to efficiently determine each bit position

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
README.md	Chinese documentation explaining the problem, solution approach, and examples
README_EN.md	English documentation with problem description, solution explanation, and complexity analysis
Solution.py	Python implementation using precomputed combinatorial values
Solution.java	Java implementation with static initialization of binomial coefficients
Solution.cpp	C++ implementation with lambda initialization of combinatorial array
Solution.go	Go implementation with init function for precomputation
Solution.ts	TypeScript implementation using BigInt for large number handling

---

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