-
-
Notifications
You must be signed in to change notification settings - Fork 9.1k
feat: add solutions to lc problem:s No.3766, 3767 #4884
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Pull request overview
This PR adds solutions for LeetCode problem #3766 "Minimum Operations to Make Binary Palindrome" from Biweekly Contest 171. The problem requires finding the minimum number of increment/decrement operations to transform each number in an array into a binary palindrome (a number whose binary representation reads the same forwards and backwards).
- Implements a preprocessing + binary search solution that precomputes all binary palindromic numbers in range [0, 2^14)
- Provides solutions in 5 programming languages: Python, Java, C++, Go, and TypeScript
- Includes comprehensive documentation in both Chinese and English with examples and complexity analysis
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.py | Python implementation using bisect for binary search on precomputed palindromes |
| Solution.java | Java implementation with custom binary search method |
| Solution.cpp | C++ implementation using STL lower_bound and bitset for binary conversion |
| Solution.go | Go implementation with helper function for palindrome checking |
| Solution.ts | TypeScript implementation using lodash's sortedIndex |
| README.md | Chinese problem description, examples, constraints, and solution explanation |
| README_EN.md | English problem description, examples, constraints, and solution explanation |
| CONTEST_README.md | Updates contest listing to include problem 3766 |
| CONTEST_README_EN.md | Updates English contest listing to include problem 3766 |
| README.md (solution/) | Adds problem 3766 entry to the main problem index |
| README_EN.md (solution/) | Adds problem 3766 entry to the English problem index |
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
9798d00 to
34c7eec
Compare
No description provided.