题目要求:
/** * Created by ql on 2018/7/15. * 双调函数 * An array is bitonic if it consists of a strictly increasing sequence of keys immediately followed by * a strictly decreasing sequence of keys * Design an algorithm that determines the maximum key in a bitonic array of size N * in time proportional to lg N. Your answer will be graded on correctness,efficiency,clarity <