852 Peak Index in a Mountain Array

 1、部分有序数组中寻找最大值

  int peakIndexInMountainArray(vector<int>& A) {
    int len = A.size() - 1;
    int i = 0;
    while (true) {
      int pos = (len + i) / 2;
      if (A[pos-1] > A[pos]) {
        len = pos;
      }else if (A[pos] < A[pos + 1]) {
        i = pos;
      } else {
        return pos;
      }
    }
  }