-
-
Notifications
You must be signed in to change notification settings - Fork 9.1k
feat: add csharp solution to lc problem: No.3577 #4894
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 a C# solution for LeetCode problem #3577 "Count the Number of Computer Unlocking Permutations". The solution implements a mathematical approach to count valid computer unlocking permutations based on complexity constraints.
- Implements the CountPermutations method using a factorial calculation with modular arithmetic
- Returns 0 when any computer has complexity less than or equal to the root computer
- Calculates (n-1)! mod (10^9 + 7) for valid cases
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
No description provided.