Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    2951 - Find the Peaks\.

    Easy

    You are given a 0-indexed array mountain. Your task is to find all the peaks in the mountain array.

    Return an array that consists of indices of peaks in the given array in any order.

    Notes:

    • A peak is defined as an element that is strictly greater than its neighboring elements.

    • The first and last elements of the array are not a peak.

    Example 1:

    Input: mountain = 2,4,4

    Output: []

    Explanation: mountain0 and mountain2 can not be a peak because they are first and last elements of the array.

    mountain1 also can not be a peak because it is not strictly greater than mountain2.

    So the answer is [].

    Example 2:

    Input: mountain = 1,4,3,8,5

    Output: 1,3

    Explanation: mountain0 and mountain4 can not be a peak because they are first and last elements of the array.

    mountain2 also can not be a peak because it is not strictly greater than mountain3 and mountain1.

    But mountain 1 and mountain3 are strictly greater than their neighboring elements. So the answer is 1,3.

    Constraints:

    • 3 <= mountain.length <= 100

    • 1 <= mountain[i] <= 100

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final List<Integer> findPeaks(IntArray mountain)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait