class Solution {
public:
int peakIndexInMountainArray(vector<int>& A) {
//寻找数组中最大值的下标
return max_element(A.begin(),A.end())-A.begin();
}
};
LeetCode:852. 山脉数组的峰顶索引
最新推荐文章于 2022-05-14 16:49:42 发布
class Solution {
public:
int peakIndexInMountainArray(vector<int>& A) {
//寻找数组中最大值的下标
return max_element(A.begin(),A.end())-A.begin();
}
};