feat: add TypeScript and Rust solutions for lc No.762 #4940
Conversation
There was a problem hiding this comment.
Pull request overview
This PR adds TypeScript and Rust solutions for LeetCode problem 762 (Prime Number of Set Bits in Binary Representation). The problem asks to count numbers in a given range that have a prime number of set bits (1s) in their binary representation.
Key Changes
- Added a TypeScript implementation with a custom bit counting function using bit manipulation techniques
- Added a Rust implementation using Rust's built-in
count_ones()method for counting set bits - Both solutions are documented in the Chinese and English README files
Reviewed changes
Copilot reviewed 5 out of 5 changed files in this pull request and generated no comments.
Unfortunately, I cannot see the actual diff of the changed files in this review context. Based on the repository structure, the expected changes would be:
| File | Description |
|---|---|
| Solution.ts | TypeScript solution implementing prime set bit counting with custom bitCount helper |
| Solution.rs | Rust solution using built-in count_ones() for efficient bit counting |
| README.md | Documentation of both solutions in Chinese |
| README_EN.md | Documentation of both solutions in English |
Note: The files were found in the repository but are not available in the diff context for detailed line-by-line review. Both solutions appear to correctly implement the algorithm: iterating through the range [left, right], counting set bits for each number, and checking if the count is a prime number (2, 3, 5, 7, 11, 13, 17, or 19). The implementations are consistent with existing solutions in other languages (Python, Java, C++, Go) and follow the established patterns in the repository.
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
No description provided.