最小化网格中的最大值

/*
 * Leetcode Problem 2371: Minimize Maximum Value in a Grid
 *
 * Problem Statement:
 * Given a m x n grid with integers, minimize the maximum value that any cell in the grid can have
 * by performing certain operations.
 *
 * Solution Approach:
 * 1. Use Java Streams to identify the cell with the maximum value.
 * 2. Apply operations to reduce the maximum value while maintaining the sum or other constraints.
 * 3. Continue the process until the maximum value is minimized.
 *
 * This approach uses a greedy algorithm to iteratively minimize the maximum value.
 */

import java.util.Arrays;

public class Solution {
    public int minimizeGridMaximum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int maxValue = Arrays.stream(grid).flatMapToInt(Arrays::stream).max().getAsInt();

        while (true) {
            int currentMax = Arrays.stream(grid).flatMapToInt(Arrays::stream).max().getAsInt();
            if (currentMax < maxValue) {
                maxValue = currentMax;
            } else {
                break;
            }

            for (int i = 0; i < m; i++) {
                for (int j = 0; j < n; j++) {
                    if (grid[i][j] == currentMax) {
                        grid[i][j]--;
                    }
                }
            }
        }

        return maxValue;
    }
}