Package g0501_0600.s0598_range_addition_ii

Class Solution

java.lang.Object

g0501_0600.s0598_range_addition_ii.Solution

public class Solution
extends Object

598 - Range Addition II.<p>Easy</p> <p>You are given an <code>m x n</code> matrix <code>M</code> initialized with all <code>0</code>&rsquo;s and an array of operations <code>ops</code>, where <code>ops[i] = [a_i, b_i]</code> means <code>M[x][y]</code> should be incremented by one for all <code>0 <= x < a_i</code> and <code>0 <= y < b_i</code>.</p> <p>Count and return <em>the number of maximum integers in the matrix after performing all the operations</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/10/02/ex1.jpg" alt="" /></p> <p><strong>Input:</strong> m = 3, n = 3, ops = [[2,2],[3,3]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> The maximum integer in M is 2, and there are four of it in M. So return 4.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> m = 3, n = 3, ops = [[2,2],[3,3],[3,3],[3,3],[2,2],[3,3],[3,3],[3,3],[2,2],[3,3],[3,3],[3,3]]</p> <p><strong>Output:</strong> 4</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> m = 3, n = 3, ops = []</p> <p><strong>Output:</strong> 9</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= m, n <= 4 * 10⁴</code></li> <li><code>0 <= ops.length <= 10⁴</code></li> <li><code>ops[i].length == 2</code></li> <li><code>1 <= a_i <= m</code></li> <li><code>1 <= b_i <= n</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	maxCount(int m, int n, int[][] ops)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

maxCount

public int maxCount(int m,
 int n,
 int[][] ops)