update: 添加问题“3577.统计计算机解锁顺序排列数”的代码和题解#1213
Conversation
cpp - AC,100.00%,35.62% py - AC,74.58%,23.73% go - AC,100.00%,25.00% 原来0号机就是第一个,只是要求不同的解锁顺序方式(不是求可行的编号方式)
java - AC,48.00%,36.00%
Signed-off-by: LetMeFly666 <814114971@qq.com>
|
这次不着急review喽 @copilot |
|
@LetMeFly666 I've opened a new pull request, #1214, to work on those changes. Once the pull request is ready, I'll request review from you. |
There was a problem hiding this comment.
Pull request overview
This PR adds a new LeetCode problem solution for problem #3577 "统计计算机解锁顺序排列数" (Count the Number of Computer Unlocking Permutations) with implementations in five programming languages (Python, Rust, Java, Go, and C++).
Key Changes:
- Added solution implementations in Python, Rust, Java, Go, and C++
- Updated configuration files to skip/track problem 3577
- Added problem entry to README.md documentation with links to blog posts and solutions
Reviewed changes
Copilot reviewed 11 out of 11 changed files in this pull request and generated 3 comments.
Show a summary per file
| File | Description |
|---|---|
| tryGoPy/ReLeetcode/recentPerDay.py | Added problem 3577 to the skip list |
| tryGoPy/ReLeetcode/processHistory.py | Added multiple problem IDs (including 3577) to the history tracking list |
| Solutions/Other-English-LearningNotes-SomeWords.md | Marked "handkerchief" for second review with green highlighting |
| README.md | Added new table row for problem 3577 with links to problem, solution, CSDN, and LeetCode |
| Codes/lib.rs | Updated include statement to reference new Rust solution file |
| Codes/3577-count-the-number-of-computer-unlocking-permutations.rs | New Rust implementation calculating permutations with modulo arithmetic |
| Codes/3577-count-the-number-of-computer-unlocking-permutations.py | New Python implementation calculating permutations with modulo arithmetic |
| Codes/3577-count-the-number-of-computer-unlocking-permutations.java | New Java implementation calculating permutations with modulo arithmetic |
| Codes/3577-count-the-number-of-computer-unlocking-permutations.go | New Go implementation calculating permutations with modulo arithmetic |
| Codes/3577-count-the-number-of-computer-unlocking-permutations.cpp | New C++ implementation calculating permutations with modulo arithmetic |
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
|
@LetMeFly666 I've opened a new pull request, #1215, to work on those changes. Once the pull request is ready, I'll request review from you. |
|
@LetMeFly666 I've opened a new pull request, #1216, to work on those changes. Once the pull request is ready, I'll request review from you. |
Co-authored-by: LetMeFly666 <56995506+LetMeFly666@users.noreply.github.com>
Co-authored-by: LetMeFly666 <56995506+LetMeFly666@users.noreply.github.com>
Co-authored-by: LetMeFly666 <56995506+LetMeFly666@users.noreply.github.com>
Co-authored-by: LetMeFly666 <56995506+LetMeFly666@users.noreply.github.com>
Co-authored-by: LetMeFly666 <56995506+LetMeFly666@users.noreply.github.com>
Co-authored-by: LetMeFly666 <56995506+LetMeFly666@users.noreply.github.com>
Make MOD constant final in Java solution
Co-authored-by: LetMeFly666 <56995506+LetMeFly666@users.noreply.github.com>
Co-authored-by: LetMeFly666 <56995506+LetMeFly666@users.noreply.github.com>
…-one Change MOD3577 from var to const in Go solution
By newSolution.py using GH on Windows | close: #1212