[LeetCode]#852. Peak Index in a Mountain Array

Environment: Python 3.7

Key technique: index.max() function

Let’s call an array A a mountain if the following properties hold:

  • A.length >= 3
  • There exists some 0 < i < A.length - 1 such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]

Given an array that is definitely a mountain, return any i such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1].

Example 1:

Example 2:

Note:

  1. 3 <= A.length <= 10000
  2. 0 <= A[i] <= 10^6
  3. A is a mountain, as defined above.

Analysis:

Assume peak is maximum value in list and use index.max() function to find location.

Solution:

Submitted result:

Reference:

https://nifannn.github.io/2018/06/29/%E7%AE%97%E6%B3%95%E7%AC%94%E8%AE%B0-Leetcode-852-Peak-Index-in-a-Mountain-Array/

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store