Time: December 7, 2019
Location: a teacher, a total of 20 people with exam hospital cafeteria on the second floor of Zhejiang soft look.
The first test the PAT, 32/155 title brush, saw Liu recalcitrant experiences, sequence preorder tree dij and the subsequent conversion is not skilled, 97 min, 230/1085.
An hour earlier to install the required software and configure the environment, can be networked download, U disk read do not enter, you have to end manipulation of transfer issued to each computer.
codeblocks need to use a new project, or else run intact.
When I do question a bit concerned about the pass rate, 0.03 the first question, the second question 0.13.
WA pay up the first question, and then post the second question also WA, Thomas spiral attitude almost explosive in situ.
Question over the order of: a first question portion, a second portion of the title, the fourth question, the third problem, the first question, the second portion of the title.
The first question: to 7 * 5 box of 26 letters, each time to a string of characters, separated by non-capital letters, the letter printed in matrix form. A plurality of separators considered together, in the case of the top of the separator.
The second question: given a single linked list, the linked list according to the number K is a boundary, the number K can be less than the last paragraph. The reverse portioned section, then the output list.
The 1-> 2-> 3-> 4-> 5-> 6-> 7, k 3, is divided into 1-> 2-> 3,4> 5-> 6,7 three sections, the reverse change into 7-> 4-> 5-> 6-> 1-> 2-> 3.
When I wanted to do more, the multi-chain removed, only consider single list, then more than one point ...... but died in unclear mistakes.
Third problem: Input: n-(expressed 1 to n, n individuals), m, m u and v represent a two appreciated, k queries, each query to L represents the number of individual L
Output: L whether individuals know each other, and no one else will know them. First determine whether or not to know each other, and then not again for L number of people.
Fourth Question: Top of pile to the small front preorder, preorder output layer. dfs time to add a pre [] array can be.
Similar questions of title:
The first question: No
The second question: PTA1133, this problem is not a singly linked list ...
Third question: PTA1150, PTA1142
Fourth Question: PTA1020
Specific problems and problem solution:
https://blog.csdn.net/l503301397/article/details/103449738
Suggest:
① brush reverse question, do not look at their own solution to a problem brush, do not translate.
② Do not card problem, WA on the next one.
③ not change the code wanted to sample, and the topic of people think empathy.
④pat of graph theory can be solved with the adjacency matrix, adjacency list is recommended if you use vector.
⑤dijstra, trees, graphs after the first sequence in the sequence conversion sequence, sequence conversion, binary search trees, etc., not only to understand but also to memorize.
Personal thoughts:
Go with four friend, 100,100,96, brush title only a small few, but this is only appearance ...... others just do not brush PAT title Bale.
This looks like there is more than one hundred out, on the whole this result can also be (I swell up?), Since 2021 do not cover something was so very good mentality.
Finished .... emm .... Although the Zhejiang University School of software can be used on the PAT against the re-examination machine, but only retest than 35%, and will not pull out a gap, it may be re-Choice?