Afternoon 12.8
1. I don't remember. It's basic.
2. The Huffman tree of {2, 3, 7, 6, 9, 13} and Its Encoding are given.
3. Sort int [] Max = {2, 4, 9, 13, 5, 8} in descending order
4. Transpose the matrix of mxn
5. Use an object-oriented method to answer questions. If birds fly, will the ostrich be a bird? How can an ostrich inherit birds?
6. Write SQL
Name |
Date |
Task |
Working hours |
|
|
... |
... |
False |
... |
|
|
... |
... |
Sick leave |
... |
|
|
... |
... |
False |
... |
|
|
... |
... |
Relocation |
... |
|
|
... |
... |
Sick leave |
... |
|
|
The following figure shows the statistics of employees grouped by task:
Name |
False |
Sick leave |
Relocation |
|
|
How to obtain this record
7. Merge two ordered linked lists into an ordered queue h without additional space
8. There are 6 numbers {1, 2, 2, 3, 4, 5}, and all 6 numbers are arranged. Limit: "4" cannot be ranked at the fourth place, and "3" and "5" cannot be connected.
9. There are 10 billion floating point numbers. To find the maximum 10 thousand floating point numbers, please DesignAlgorithm(Pay attention to algorithm efficiency)