range-addition-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an <code>m x n</code> matrix <code>M</code> initialized with all <code>0</code>&#39;s and an array of operations <code>ops</code>, where <code>ops[i] = [ai, bi]</code> means <code>M[x][y]</code> should be incremented by one for all <code>0 &lt;= x &lt; ai</code> and <code>0 &lt;= y &lt; bi</code>.

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

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/02/ex1.jpg" style="width: 750px; height: 176px;" />
<pre>
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.
</pre>

Example 2:

<pre>
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
</pre>

Example 3:

<pre>
Input: m = 3, n = 3, ops = []
Output: 9
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= m, n &lt;= 4 * 104</code></li>
	<li><code>0 &lt;= ops.length &lt;= 104</code></li>
	<li><code>ops[i].length == 2</code></li>
	<li><code>1 &lt;= ai &lt;= m</code></li>
	<li><code>1 &lt;= bi &lt;= n</code></li>
</ul>

maxCount

Range Addition II

Range Addition

range-addition

区间加法

Sum of Matrix After Queries

sum-of-matrix-after-queries

查询后矩阵的和

Array

Math

给你一个 <code>m x&nbsp;n</code> 的矩阵&nbsp;<code>M</code> 和一个操作数组 <code>op</code> 。矩阵初始化时所有的单元格都为 <code>0</code> 。<code>ops[i] = [ai, bi]</code> 意味着当所有的 <code>0 &lt;= x &lt; ai</code> 和 <code>0 &lt;= y &lt; bi</code> 时， <code>M[x][y]</code> 应该加 1。

在&nbsp;执行完所有操作后&nbsp;，计算并返回&nbsp;矩阵中最大整数的个数&nbsp;。

&nbsp;

示例 1:

<img alt="" src="https://assets.leetcode.com/uploads/2020/10/02/ex1.jpg" style="height: 176px; width: 750px;" />

<pre>
输入: m = 3, n = 3，ops = [[2,2],[3,3]]
输出: 4
解释: M 中最大的整数是 2, 而且 M 中有4个值为2的元素。因此返回 4。
</pre>

示例 2:

<pre>
输入: 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]]
输出: 4
</pre>

示例 3:

<pre>
输入: m = 3, n = 3, ops = []
输出: 9
</pre>

&nbsp;

提示:

<meta charset="UTF-8" />

<ul>
	<li><code>1 &lt;= m, n &lt;= 4 * 104</code></li>
	<li><code>0 &lt;= ops.length &lt;= 104</code></li>
	<li><code>ops[i].length == 2</code></li>
	<li><code>1 &lt;= ai&nbsp;&lt;= m</code></li>
	<li><code>1 &lt;= bi&nbsp;&lt;= n</code></li>
</ul>