目录题目要求思路:模拟Javac++Rust总结题目要求 思路:模拟 定义两个数组分别记录每行or每列中为0的元素;0所在的行列清零也就意味着元素所在行or列有0则置零【废话连篇
class Solution {
public void setZeroes(int[][] matrix) {
int n = matrix.length, m = matrix[0].length;
boolean[] rows = new boolean[n], cols = new boolean[m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
if (matrix[i][j] == 0)
rows[i] = cols[j] = true;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
if (rows[i] || cols[j])
matrix[i][j] = 0;
}
}
}
class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
int n = matrix.size(), m = matrix[0].size();
bool rows[n], cols[m];
memset(rows, 0, sizeof(rows));
memset(cols, 0, sizeof(cols));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
if (matrix[i][j] == 0)
rows[i] = cols[j] = true;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
if (rows[i] || cols[j])
matrix[i][j] = 0;
}
}
};
impl Solution {
pub fn set_zeroes(matrix: &mut Vec<Vec<i32>>) {
let (n, m) = (matrix.len(), matrix[0].len());
let (mut rows, mut cols) = (vec![false; n], vec![false; m]);
for i in 0..n {
for j in 0..m {
if matrix[i][j] == 0 {
rows[i] = true;
cols[j] = true;
}
}
}
for i in 0.. n {
for j in 0..m {
if rows[i] || cols[j] {
matrix[i][j] = 0;
}
}
}
}
}
因为是中等题所以纠结了半天是不是有什么精巧奇妙的算法解题……emmmm结果就只是通过修改给出数组来标记,空间复杂度能降到常数了,有意义但不大
以上就是Java C++ LeetCode面试零矩阵的详细内容,更多关于Java C++ 面试零矩阵的资料请关注编程网其它相关文章!
--结束END--
本文标题: Java C++ leetcode面试零矩阵
本文链接: https://www.lsjlt.com/news/169522.html(转载时请注明来源链接)
有问题或投稿请发送至: 邮箱/279061341@qq.com QQ/279061341
下载Word文档到电脑,方便收藏和打印~
2024-03-01
2024-03-01
2024-02-29
2024-02-29
2024-02-29
2024-02-29
2024-02-29
2024-02-29
2024-02-29
2024-02-29
回答
回答
回答
回答
回答
回答
回答
回答
回答
回答
0