双调数组的查找

最新推荐文章于 2023-04-21 14:24:03 发布

原创

最新推荐文章于 2023-04-21 14:24:03 发布 · 796 阅读

2 ·

CC 4.0 BY-SA版权

博客探讨了如何在双调数组中高效地查找最大值。通过将数组视为抛物线，利用二分查找思想，根据中间元素判断并缩小搜索范围，达到O(log N)的时间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目要求：

/**
 * 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
 * and conciseness.