-
-
Notifications
You must be signed in to change notification settings - Fork 9.1k
feat: add solutions to lc problem: No.0955 #4877
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 pull request adds solutions for LeetCode problem No.0955 "Delete Columns to Make Sorted II" in multiple programming languages. The problem requires finding the minimum number of columns to delete from an array of equal-length strings to ensure the resulting strings are in lexicographical order.
- Implements a greedy algorithm that processes columns from left to right
- Tracks which adjacent string pairs have already established lexicographical ordering
- Deletes a column only when it would violate the ordering for a pair that hasn't been settled
Reviewed changes
Copilot reviewed 8 out of 8 changed files in this pull request and generated no comments.
Show a summary per file
| File | Description |
|---|---|
| Solution.py | Python implementation of the greedy column deletion algorithm |
| Solution.java | Java implementation with same greedy approach |
| Solution.cpp | C++ implementation using vector and bool arrays |
| Solution.go | Go implementation following the same algorithm pattern |
| Solution.ts | TypeScript implementation with typed arrays |
| Solution.rs | Rust implementation using Vec and as_bytes() for character access |
| README.md | Chinese documentation with problem description, examples, and solution explanation |
| README_EN.md | English documentation with equivalent content |
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
No description provided.