increment-submatrices-by-one

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 a positive integer <code>n</code>, indicating that we initially have an <code>n x n</code>&nbsp;0-indexed integer matrix <code>mat</code> filled with zeroes.

You are also given a 2D integer array <code>query</code>. For each <code>query[i] = [row1i, col1i, row2i, col2i]</code>, you should do the following operation:

<ul>
	<li>Add <code>1</code> to every element in the submatrix with the top left corner <code>(row1i, col1i)</code> and the bottom right corner <code>(row2i, col2i)</code>. That is, add <code>1</code> to <code>mat[x][y]</code> for all <code>row1i &lt;= x &lt;= row2i</code> and <code>col1i &lt;= y &lt;= col2i</code>.</li>
</ul>

Return the matrix <code>mat</code> after performing every query.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2022/11/24/p2example11.png" style="width: 531px; height: 121px;" />
<pre>
Input: n = 3, queries = [[1,1,2,2],[0,0,1,1]]
Output: [[1,1,0],[1,2,1],[0,1,1]]
Explanation: The diagram above shows the initial matrix, the matrix after the first query, and the matrix after the second query.
- In the first query, we add 1 to every element in the submatrix with the top left corner (1, 1) and bottom right corner (2, 2).
- In the second query, we add 1 to every element in the submatrix with the top left corner (0, 0) and bottom right corner (1, 1).
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2022/11/24/p2example22.png" style="width: 261px; height: 82px;" />
<pre>
Input: n = 2, queries = [[0,0,1,1]]
Output: [[1,1],[1,1]]
Explanation: The diagram above shows the initial matrix and the matrix after the first query.
- In the first query we add 1 to every element in the matrix.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 500</code></li>
	<li><code>1 &lt;= queries.length &lt;= 104</code></li>
	<li><code>0 &lt;= row1i &lt;= row2i &lt; n</code></li>
	<li><code>0 &lt;= col1i &lt;= col2i &lt; n</code></li>
</ul>

rangeAddQueries

Increment Submatrices by One

Range Sum Query 2D - Mutable

range-sum-query-2d-mutable

二维区域和检索 - 矩阵可修改

Count Positions on Street With Required Brightness

count-positions-on-street-with-required-brightness

计算街道上满足所需亮度的位置数量

Array

Matrix

Prefix Sum

给你一个正整数 <code>n</code> ，表示最初有一个 <code>n x n</code> 、下标从 0 开始的整数矩阵 <code>mat</code> ，矩阵中填满了 0 。

另给你一个二维整数数组 <code>query</code> 。针对每个查询 <code>query[i] = [row1i, col1i, row2i, col2i]</code> ，请你执行下述操作：

<ul>
	<li>找出 左上角 为 <code>(row1i, col1i)</code> 且 右下角 为 <code>(row2i, col2i)</code> 的子矩阵，将子矩阵中的 每个元素 加 <code>1</code> 。也就是给所有满足 <code>row1i &lt;= x &lt;= row2i</code> 和 <code>col1i &lt;= y &lt;= col2i</code> 的 <code>mat[x][y]</code> 加 <code>1</code> 。</li>
</ul>

返回执行完所有操作后得到的矩阵 <code>mat</code> 。

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode.com/uploads/2022/11/24/p2example11.png" style="width: 531px; height: 121px;" />

<pre>
输入：n = 3, queries = [[1,1,2,2],[0,0,1,1]]
输出：[[1,1,0],[1,2,1],[0,1,1]]
解释：上图所展示的分别是：初始矩阵、执行完第一个操作后的矩阵、执行完第二个操作后的矩阵。
- 第一个操作：将左上角为 (1, 1) 且右下角为 (2, 2) 的子矩阵中的每个元素加 1 。 
- 第二个操作：将左上角为 (0, 0) 且右下角为 (1, 1) 的子矩阵中的每个元素加 1 。 
</pre>

示例 2：

<img alt="" src="https://assets.leetcode.com/uploads/2022/11/24/p2example22.png" style="width: 261px; height: 82px;" />

<pre>
输入：n = 2, queries = [[0,0,1,1]]
输出：[[1,1],[1,1]]
解释：上图所展示的分别是：初始矩阵、执行完第一个操作后的矩阵。 
- 第一个操作：将矩阵中的每个元素加 1 。</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 500</code></li>
	<li><code>1 &lt;= queries.length &lt;= 104</code></li>
	<li><code>0 &lt;= row1i &lt;= row2i &lt; n</code></li>
	<li><code>0 &lt;= col1i &lt;= col2i &lt; n</code></li>
</ul>