• Home
• com.github.javadev
• leetcode-in-java11
• 1.19
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0501_0600.s0598_range_addition_ii.readme.md Maven / Gradle / Ivy

598\. Range Addition II

Easy

You are given an `m x n` matrix `M` initialized with all `0`'s and an array of operations `ops`, where ops[i] = [ai, bi] means `M[x][y]` should be incremented by one for all 0 <= x < ai and 0 <= y < bi.

Count and return _the number of maximum integers in the matrix after performing all the operations_.

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/10/02/ex1.jpg)

**Input:** m = 3, n = 3, ops = [[2,2],[3,3]]

**Output:** 4

**Explanation:** The maximum integer in M is 2, and there are four of it in M. So return 4. 

**Example 2:**

**Input:** 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]]

**Output:** 4 

**Example 3:**

**Input:** m = 3, n = 3, ops = []

**Output:** 9 

**Constraints:**

*   1 <= m, n <= 4 * 104
*   0 <= ops.length <= 104
*   `ops[i].length == 2`
*   1 <= ai <= m
*   1 <= bi <= n