Originality is not easy, please do not reprint without permission.
Article directory
- L1-1 I'm going to win today
- L1-2 diamonds
- L1-3 Who can enter the library
- L1-4 save the aliens
- L1-5 Try your luck
- Questions on the L1-6 Stockholm train
- L1-7 Mechanic Mstadio
- L1-8 Quietly recommended
- L2-1 Pine branch
- L2-2 The boss's schedule
- L2-3 Longlong Takeaway
- L2-4 Mass Lover
- L3-1 Thousand-handed Avalokitesvara
- L3-2 The question about depth-first search and reverse order pair should not be difficult, right?
- L3-3 Textbook profanity
Sure enough, I haven't played for too long, and I still can't feel it. The mentality of details is not the best state. The L2 questions in the competition are only L2-2A, and the other questions only got a part of the score. After the game, I wrote it down in the same way. Fortunately, it did not affect the teammates' gold.
When making up the question, I rewrote it in Go, and the code is placed at https://github.com/jiang4869/go-algorithm
. Currently, the L1 and L2 parts have been supplemented, and the L3 will be supplemented when there is time.
L1-1 I'm going to win today
L1-2 diamonds
L1-3 Who can enter the library
L1-4 save the aliens
L1-5 Try your luck
Questions on the L1-6 Stockholm train
L1-7 Mechanic Mstadio
L1-8 Quietly recommended
L2-1 Pine branch
L2-2 The boss's schedule
L2-3 Longlong Takeaway
L2-4 Mass Lover
L3-1 Thousand-handed Avalokitesvara
L3-2 The question about depth-first search and reverse order pair should not be difficult, right?
L3-3 Textbook profanity
If this article is helpful to you, please click one-click triple.
Originality is not easy, please do not reprint without permission.
Blog homepage: https://xiaojujiang.blog.csdn.net/