[Program Ape Face question selected 100 questions]10. Two digits in the sorted array and for the given value

The sword refers to the sum of two digits of S.

The sum of the points of offer and the successive positive sequence of s

Extension (1): Enter an array to infer that the array is not present in three digits I, J, K, satisfy I+j+k equals 0.

Extension (2): Suppose the input array is not sorted, but know the range of the numbers inside, other conditions are unchanged, how to find these two numbers in O (n) time? The basic idea is to first use the hash table to achieve O (n) sorting (please refer to the question series 57th). The next steps are all the same.

[Program Ape Face question selected 100 questions]10. Two digits in the sorted array and for the given value