- There is a string of data to find the maximum incremental sequence. (For example, 4 2 6 3 1 5, the maximum incremental sequence is 2 3 5, and the output is 3)
- A and B are two integer sets, and an algorithm is designed to calculate the intersection, which is as efficient as possible.
- A large file record containing 50 m and URL, a small file record containing 500 URLs, to find the same URL in the two records, requires the minimum space and time.
- Implement a function and calculate the number of operations required for a positive integer n. Operation rule: if n is an integer multiple of 3, divide it by 3. If n is not an integer multiple of 3, you can add 2 or subtract 1 to continue processing. For example: func (7) = 2, it can be proved that at least three operations are required n = 7 n-1 = 6 N/3 = 2 n-1 = 1: the Int function (unsign int N) n is the input, and the minimum number of operations is returned.
- I forgot another question...
The idea and code will be added later.
Mogujie.com pen exam 2015 school recruitment (technical post)
