大于数组中上一个和下一个元素的元素

给定一个由N个整数组成的数组。任务是从数组中打印大于其前一个和下一个元素的元素。

例子：

Input : arr[] = {2, 3, 1, 5, 4, 9, 8, 7, 5}
Output : 3, 5, 9
In above given example 3 is greater than its 
left element 2 and right element 1. 
Similar logic is applied to other elements 
hence our final output is 3, 5, 9.

Input : arr[] = {1, 2, 3, 2, 1}
Output : 3

方法：由于第一个元素(arr [0])的左边没有元素，最后一个元素(arr [N-1])的右边没有元素，所以这两个元素将从最终答案中排除。

现在，遍历从索引1到N-2的数组，并针对每个元素arr [i]检查arr [i]> arr [i-1]和arr [i]> arr [i + 1] 。

下面是上述方法的实现：

C++

// C++ program to print elements greater than
// the previous and next element in an Array
#include 
using namespace std;
  
// Function to print elements greater than
// the previous and next element in an Array
void printElements(int arr[], int n)
{
    // Traverse array from index 1 to n-2
    // and check for the given condition
    for (int i = 1; i < n - 1; i++) {
        if (arr[i] > arr[i - 1] and arr[i] > arr[i + 1])
            cout << arr[i] << " ";
    }
}
  
// Driver Code
int main()
{
    int arr[] = { 2, 3, 1, 5, 4, 9, 8, 7, 5 };
    int n = sizeof(arr) / sizeof(arr[0]);
  
    printElements(arr, n);
  
    return 0;
}

Java

// Java program to print elements greater than 
// the previous and next element in an Array 
class GfG 
{ 
  
// Function to print elements greater than 
// the previous and next element in an Array 
static void printElements(int arr[], int n) 
{ 
    // Traverse array from index 1 to n-2 
    // and check for the given condition 
    for (int i = 1; i < n - 1; i++)
    { 
        if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) 
            System.out.print(arr[i] + " "); 
    } 
} 
  
// Driver Code 
public static void main(String[] args) 
{ 
    int arr[] = { 2, 3, 1, 5, 4, 9, 8, 7, 5 }; 
    int n = arr.length; 
  
    printElements(arr, n); 
} 
} 
  
// This code is contributed by Prerna Saini

Python3

# Python 3 program to print elements greater than
# the previous and next element in an Array
  
# Function to print elements greater than
# the previous and next element in an Array
def printElements(arr, n):
      
    # Traverse array from index 1 to n-2
    # and check for the given condition
    for i in range(1, n - 1, 1):
        if (arr[i] > arr[i - 1] and 
            arr[i] > arr[i + 1]):
            print(arr[i], end = " ")
  
# Driver Code
if __name__ == '__main__':
    arr = [2, 3, 1, 5, 4, 9, 8, 7, 5]
    n = len(arr)
  
    printElements(arr, n)
      
# This code is contributed by
# Surendra_Gangwar

C#

using System;
  
// c# program to print elements greater than 
// the previous and next element in an Array 
public class GfG
{
  
// Function to print elements greater than 
// the previous and next element in an Array 
public static void printElements(int[] arr, int n)
{
    // Traverse array from index 1 to n-2 
    // and check for the given condition 
    for (int i = 1; i < n - 1; i++)
    {
        if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1])
        {
            Console.Write(arr[i] + " ");
        }
    }
}
  
// Driver Code 
public static void Main(string[] args)
{
    int[] arr = new int[] {2, 3, 1, 5, 4, 9, 8, 7, 5};
    int n = arr.Length;
  
    printElements(arr, n);
}
}

PHP

 $arr[$i - 1] and
            $arr[$i] > $arr[$i + 1])
            echo $arr[$i] . " ";
    }
}
  
// Driver Code
$arr = array(2, 3, 1, 5, 4, 9, 8, 7, 5);
$n = sizeof($arr);
  
printElements($arr, $n);
  
// This code is contributed
// by Akanksha Rai

输出：

3 5 9