两次最大出现之间的最小距离

您将获得一个n元素数组，其基本条件是最大元素的出现不止一次。您必须找到最大值之间的最小距离。 (n> = 2)。
例子：

Input : arr[] = {3, 5, 2, 3, 5, 3, 5}
Output : Minimum Distance = 2
Explanation : Greatest element is 5 and its index 
are 1, 4 and 6. Resulting minimum distance of 2 
from position 4 to 6.

Input : arr[] = {1, 1, 1, 1, 1, 1}
Output : Minimum Distance = 1
Explanation : Greatest element is 1 and its index 
are 0, 1, 2, 3, 4 and 5. Resulting minimum distance
of 1.

一个基本方法是在O(n ² )中运行。首先，我们找到最大元素。然后，对于等于最大元素的每个元素，我们找到最接近的最大元素。
高效的解决方案只需遍历数组即可完成我们的工作。我们初始化maximum_element = arr [0]，min_distance = n和index =0。之后，对于每个元素，我们应检查元素是否等于，大于或小于最大元素。根据三种情况，我们有以下选择：

• 情况a：如果element等于maximum_element，则更新min_dis = min(min_dis，(i-index))并更新index = i;
• 情况b：如果element大于maximum_element，则更新maximum_element = arr [i]，索引= i，min_dis = n。
• 情况c：如果element小于maximum_element，则迭代到下一个元素。

C

// C program to find Min distance
// of maximum element
#include
using namespace std;
 
//function to return min distance
int minDistance (int arr[], int n)
{
    int maximum_element = arr[0];
    int min_dis = n;
    int index = 0;
 
    for (int i=1; iJava

// Java program to find Min distance
// of maximum element
class GFG
{
     
    // function to return min distance
    static int minDistance (int arr[], int n)
    {
        int maximum_element = arr[0];
        int min_dis = n;
        int index = 0;
 
        for (int i=1; iPython3

# Python3 program to find Min
# distance of maximum element
 
# Function to return min distance
def minDistance (arr, n):
 
    maximum_element = arr[0]
    min_dis = n
    index = 0
 
    for i in range(1, n):
     
        # case a
        if (maximum_element == arr[i]):
         
            min_dis = min(min_dis, (i - index))
            index = i
         
 
        # case b
        elif (maximum_element < arr[i]):
         
            maximum_element = arr[i]
            min_dis = n
            index = i
         
 
        # case c
        else:
            continue
     
 
    return min_dis
 
 
# driver program
arr = [6, 3, 1, 3, 6, 4, 6]
n = len(arr)
print("Minimum distance =", minDistance(arr, n))
  
# This code is contributed by Smitha Dinesh Semwal



C#

// C# program to find Min distance
// of maximum element
using System;
 
class GFG {
     
    // function to return min distance
    static int minDistance (int []arr, int n)
    {
        int maximum_element = arr[0];
        int min_dis = n;
        int index = 0;
 
        for (int i = 1; i < n; i++)
        {
             
            // case a
            if (maximum_element == arr[i])
            {
                min_dis = Math.Min(min_dis,
                                (i - index));
                index = i;
            }
     
            // case b
            else if (maximum_element < arr[i])
            {
                maximum_element = arr[i];
                min_dis = n;
                index = i;
            }
     
            // case c
            else
                continue;
        }
     
        return min_dis;
    }
     
    // Driver code
    public static void Main ()
    {
        int []arr = {6, 3, 1, 3, 6, 4, 6};
        int n = arr.Length;
         
        Console.WriteLine("Minimum distance = "
                        + minDistance(arr, n));
    }
}
 
// This code is contributed by vt_m.







Javascript

 
// JavaScript program to find Min distance
// of maximum element
 
    // function to return min distance
    function minDistance (arr, n)
    {
        let maximum_element = arr[0];
        let min_dis = n;
        let index = 0;
   
        for (let i=1; i<n; i++)
        {
               
            // case a
            if (maximum_element == arr[i])
            {
                min_dis = Math.min(min_dis, (i-index));
                index = i;
            }
       
            // case b
            else if (maximum_element < arr[i])
            {
                maximum_element = arr[i];
                min_dis = n;
                index = i;
            }
       
            // case c
            else
                continue;
        }
       
        return min_dis;
    } 
  
// Driver code
 
        let arr = [6, 3, 1, 3, 6, 4, 6];
        let n = arr.length;
        document.write("Minimum distance = "+minDistance(arr, n));
 




输出 ： 

Minimum distance = 2