标签:Count Square Submatrices There ans squares side dp matrix
Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.
Example 1:
Input: matrix =
[
[0,1,1,1],
[1,1,1,1],
[0,1,1,1]
]
Output: 15
Explanation:
There are 10 squares of side 1.
There are 4 squares of side 2.
There is 1 square of side 3.
Total number of squares = 10 + 4 + 1 = 15.
Example 2:
Input: matrix =
[
[1,0,1],
[1,1,0],
[1,1,0]
]
Output: 7
Explanation:
There are 6 squares of side 1.
There is 1 square of side 2.
Total number of squares = 6 + 1 = 7.
Constraints:
- 1 <= arr.length <= 300
- 1 <= arr[0].length <= 300
- 0 <= arr[i][j] <= 1
不知道该怎么讲, 大家看代码吧
代码实现(Rust):
impl Solution {
pub fn count_squares(matrix: Vec<Vec<i32>>) -> i32 {
let mut ans = 0;
let mut dp = vec![vec![0; matrix[0].len()]; matrix.len()];
for r in 0..matrix.len() {
for c in 0..matrix[0].len() {
if matrix[r][c] == 0 {
dp[r][c] = 0;
} else {
if r == 0 || c == 0 {
if matrix[r][c] == 1 {
ans += 1;
}
dp[r][c] = matrix[r][c];
} else {
let count = dp[r-1][c-1].min(dp[r-1][c]).min(dp[r][c-1]) + 1;
dp[r][c] = count;
ans += count;
}
}
}
}
ans
}
}
标签:Count,Square,Submatrices,There,ans,squares,side,dp,matrix 来源: https://blog.csdn.net/wangjun861205/article/details/120241656
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。