mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-07 17:56:02 +08:00
Remove CalculateMaxOfMin
(#5079)
This commit is contained in:
@ -1,42 +0,0 @@
|
||||
/**
|
||||
* Author : Siddhant Swarup Mallick
|
||||
* Github : https://github.com/siddhant2002
|
||||
*/
|
||||
|
||||
/**
|
||||
* Program description - Given an integer array. The task is to find the maximum of the minimum of
|
||||
* the array
|
||||
*/
|
||||
package com.thealgorithms.stacks;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
public class CalculateMaxOfMin {
|
||||
|
||||
public static int calculateMaxOfMin(int[] a) {
|
||||
int n = a.length;
|
||||
int[] ans = new int[n];
|
||||
int[] arr2 = Arrays.copyOf(a, n);
|
||||
Arrays.sort(arr2);
|
||||
int maxNum = arr2[arr2.length - 1];
|
||||
ans[0] = maxNum;
|
||||
int index = 1;
|
||||
while (index != ans.length) {
|
||||
int[] minimums = new int[n - index];
|
||||
for (int i = 0; i < n - index; i++) {
|
||||
int[] windowArray = Arrays.copyOfRange(a, i, i + index + 1);
|
||||
Arrays.sort(windowArray);
|
||||
int minNum = windowArray[0];
|
||||
minimums[i] = minNum;
|
||||
}
|
||||
Arrays.sort(minimums);
|
||||
ans[index] = minimums[minimums.length - 1];
|
||||
index += 1;
|
||||
}
|
||||
return ans[0];
|
||||
}
|
||||
}
|
||||
/**
|
||||
* Given an integer array. The task is to find the maximum of the minimum of the
|
||||
* given array
|
||||
*/
|
Reference in New Issue
Block a user