count-submatrices-with-equal-frequency-of-x-and-y

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given a 2D character matrix <code>grid</code>, where <code>grid[i][j]</code> is either <code>&#39;X&#39;</code>, <code>&#39;Y&#39;</code>, or <code>&#39;.&#39;</code>, return the number of submatrices that contain:

<ul>
	<li><code>grid[0][0]</code></li>
	<li>an equal frequency of <code>&#39;X&#39;</code> and <code>&#39;Y&#39;</code>.</li>
	<li>at least one <code>&#39;X&#39;</code>.</li>
</ul>

&nbsp;
Example 1:

<div class="example-block">
Input: grid = [[&quot;X&quot;,&quot;Y&quot;,&quot;.&quot;],[&quot;Y&quot;,&quot;.&quot;,&quot;.&quot;]]

Output: 3

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/06/07/examplems.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 175px; height: 350px;" />
</div>

Example 2:

<div class="example-block">
Input: grid = [[&quot;X&quot;,&quot;X&quot;],[&quot;X&quot;,&quot;Y&quot;]]

Output: 0

Explanation:

No submatrix has an equal frequency of <code>&#39;X&#39;</code> and <code>&#39;Y&#39;</code>.
</div>

Example 3:

<div class="example-block">
Input: grid = [[&quot;.&quot;,&quot;.&quot;],[&quot;.&quot;,&quot;.&quot;]]

Output: 0

Explanation:

No submatrix has at least one <code>&#39;X&#39;</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= grid.length, grid[i].length &lt;= 1000</code></li>
	<li><code>grid[i][j]</code> is either <code>&#39;X&#39;</code>, <code>&#39;Y&#39;</code>, or <code>&#39;.&#39;</code>.</li>
</ul>

第 405 场周赛

weekly-contest-405

numberOfSubmatrices

资深工程师

Count Submatrices With Equal Frequency of X and Y

Maximum Equal Frequency

maximum-equal-frequency

最大相等频率

Count Submatrices With All Ones

count-submatrices-with-all-ones

统计全 1 子矩形

Array

Matrix

Prefix Sum

给你一个二维字符矩阵 <code>grid</code>，其中 <code>grid[i][j]</code> 可能是 <code>'X'</code>、<code>'Y'</code> 或 <code>'.'</code>，返回满足以下条件的子矩阵数量：

<ul>
	<li>包含 <code>grid[0][0]</code></li>
	<li><code>'X'</code> 和 <code>'Y'</code> 的频数相等。</li>
	<li>至少包含一个 <code>'X'</code>。</li>
</ul>

&nbsp;

示例 1：

<div class="example-block">
输入： grid = [["X","Y","."],["Y",".","."]]

输出： 3

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/06/07/examplems.png" style="padding: 10px; background: rgb(255, 255, 255); border-radius: 0.5rem; width: 175px; height: 350px;" />
</div>

示例 2：

<div class="example-block">
输入： grid = [["X","X"],["X","Y"]]

输出： 0

解释：

不存在满足 <code>'X'</code> 和 <code>'Y'</code> 频数相等的子矩阵。
</div>

示例 3：

<div class="example-block">
输入： grid = [[".","."],[".","."]]

输出： 0

解释：

不存在满足至少包含一个 <code>'X'</code> 的子矩阵。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= grid.length, grid[i].length &lt;= 1000</code></li>
	<li><code>grid[i][j]</code> 可能是 <code>'X'</code>、<code>'Y'</code> 或 <code>'.'</code>.</li>
</ul>