算法

162. Find Peak Element题目A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array. You must write an algorithm that runs in O(log n) time. Example...

数据结构学习绪论线性表栈、队列、数组串树与二叉树图查找排序数据结构与算法分析.C语言描述 大话数据结构 算法导论绪论线性表栈、队列、数组串树与二叉树图查找排序