【Leetcode_easy】852. Peak Index in a Mountain Array
problem
852. Peak Index in a Mountain Array
solution1:
class Solution { public: int peakIndexInMountainArray(vector<int>& A) { return max_element(A.begin(), A.end())-A.begin(); } };
solution2:
class Solution { public: int peakIndexInMountainArray(vector<int>& A) { for(int i=0; i<A.size()-1; ++i) { if(A[i]>A[i+1]) return i; } return 0;//err.. } };
solution3:
class Solution { public: int peakIndexInMountainArray(vector<int>& A) { int left = 0, right = A.size()-1; int mid = 0; while(left<right) { mid = left + (right-left)/2; if(A[mid]<A[mid+1]) left = mid + 1;//err... else right = mid;//errr... } return right;//err.. } };
参考
1. Leetcode_easy_852. Peak Index in a Mountain Array;
2. grandyang;
3. discuss;
完
各美其美,美美与共,不和他人作比较,不对他人有期待,不批判他人,不钻牛角尖。
心正意诚,做自己该做的事情,做自己喜欢做的事情,安静做一枚有思想的技术媛。
版权声明,转载请注明出处:https://www.cnblogs.com/happyamyhope/
心正意诚,做自己该做的事情,做自己喜欢做的事情,安静做一枚有思想的技术媛。
版权声明,转载请注明出处:https://www.cnblogs.com/happyamyhope/