2016 Huawei School Recruitment Test record

3 questions, score 100/200/300, are not difficult

1. Enter a string that outputs a new string that is sorted by the absolute value of each letter and the ' U ' distance (if identical, arranged in the position relationship of the original string)

The core is to write a sort of CMP function, no difficulty

2. Continuation 1s: time given a string type (2016/09/13-13:13:13), output the next second

Consider the leap year situation and carry it in sequence.

3. Imitation vending machine: Give a string (shape such as P 1,p 5,p 5,b a1,b a3,b A2) and carry out the initial state of the pre-box, cash drawer, p K (1/2/5) is plugged into a K-yuan note, b Ak (1/2/3) said to buy 1/2/3 goods, to ensure that the input is legal, When looking for the minimum number of change notes, the output of the cash drawer and the status of the container.

Just a few details.

The whole without any algorithm problems, are pure process of the topic, but also simple, two hours more ample time.

2016 Huawei School Recruitment Test record