598. Range Addition II

原创于 2018-01-15 15:09:28 发布 · 199 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

48 篇文章

订阅专栏

本文介绍了一个算法问题，即在初始化为0的m*n矩阵上执行一系列加法操作后，如何计算矩阵中最大整数的数量。通过分析操作特点，提供了一种高效算法实现。

题目描述：

Given an m * n matrix M initialized with all 0's and several update operations.
Operations are represented by a 2D array, and each operation is represented by an array with two positive integers a and b, which means M[i][j] should be added by one for all 0 <= i < a and 0 <= j < b.
You need to count and return the number of maximum integers in the matrix after performing all the operations.

思路：

class Solution {
    public int maxCount(int m, int n, int[][] ops) {
        if (ops == null || ops.length == 0)
            return m * n;
        int row = m;
        int col = n;
        for (int[] op : ops)
        {
            row = Math.min(row, op[0]);
            col = Math.min(col, op[1]);
        }
        return row * col;
    }
}