• Home
• com.github.javadev
• leetcode-in-java21
• 1.30
• 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.

g1501_1600.s1504_count_submatrices_with_all_ones.readme.md Maven / Gradle / Ivy

1504\. Count Submatrices With All Ones

Medium

Given an `m x n` binary matrix `mat`, _return the number of **submatrices** that have all ones_.

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/10/27/ones1-grid.jpg)

**Input:** mat = [[1,0,1],[1,1,0],[1,1,0]]

**Output:** 13

**Explanation:** 

There are 6 rectangles of side 1x1.

There are 2 rectangles of side 1x2. 

There are 3 rectangles of side 2x1.

There is 1 rectangle of side 2x2. 

There is 1 rectangle of side 3x1. 

Total number of rectangles = 6 + 2 + 3 + 1 + 1 = 13.

**Example 2:**

![](https://assets.leetcode.com/uploads/2021/10/27/ones2-grid.jpg)

**Input:** mat = [[0,1,1,0],[0,1,1,1],[1,1,1,0]]

**Output:** 24

**Explanation:**

There are 8 rectangles of side 1x1.

There are 5 rectangles of side 1x2.

There are 2 rectangles of side 1x3.

There are 4 rectangles of side 2x1.

There are 2 rectangles of side 2x2.

There are 2 rectangles of side 3x1.

There is 1 rectangle of side 3x2. 

Total number of rectangles = 8 + 5 + 2 + 4 + 2 + 2 + 1 = 24.

**Constraints:**

*   `1 <= m, n <= 150`
*   `mat[i][j]` is either `0` or `1`.