Skip to content

Document CalculateMaxOfMin #5038

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed

Document CalculateMaxOfMin #5038

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
05fc0c1
I added some descriptive javadoc and commments throughout the Calcula…
mvouzikis Feb 5, 2024
b2f0f16
fix: use proper formatting
vil02 Feb 5, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 24 additions & 7 deletions src/main/java/com/thealgorithms/stacks/CalculateMaxOfMin.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,39 +4,56 @@
*/

/**
* Program description - Given an integer array. The task is to find the maximum of the minimum of
* the array
* The {@code CalculateMaxOfMin} class provides a method to calculate the maximum
* value among the minimum values of a given array.
*/
package com.thealgorithms.stacks;

import java.util.*;
import java.util.Arrays;

public class CalculateMaxOfMin {

/**
* Calculates the maximum value among the minimum values of all subarrays.
*
* @param a The input array of integers.
* @return The maximum value among the minimum values of all subarrays.
*
* The algorithm works by considering subarrays of increasing lengths using
* a sliding window approach. It calculates the minimum value for each subarray
* and then finds the maximum value among those minimum values. This process
* is repeated for different subarray lengths until the entire array is considered.
* The result is the maximum of the minimum values for all subarrays.
*/
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;

// Iterate through the array to calculate the maximum of the minimum values
int index = 1;
while (index != ans.length) {

// Array to store minimum values for subarrays of the specified length
int[] minimums = new int[n - index];

// Calculate minimum values for each subarray
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;
}

// Sort the minimums array and set the corresponding value in the result array
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
*/