mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 11:21:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
35
算法题(国内版)/problem (Chinese)/零矩阵 [zero-matrix-lcci].html
Normal file
35
算法题(国内版)/problem (Chinese)/零矩阵 [zero-matrix-lcci].html
Normal file
@@ -0,0 +1,35 @@
|
||||
<p>编写一种算法,若M × N矩阵中某个元素为0,则将其所在的行与列清零。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong>
|
||||
[
|
||||
[1,1,1],
|
||||
[1,0,1],
|
||||
[1,1,1]
|
||||
]
|
||||
<strong>输出:</strong>
|
||||
[
|
||||
[1,0,1],
|
||||
[0,0,0],
|
||||
[1,0,1]
|
||||
]
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong>
|
||||
[
|
||||
[0,1,2,0],
|
||||
[3,4,5,2],
|
||||
[1,3,1,5]
|
||||
]
|
||||
<strong>输出:</strong>
|
||||
[
|
||||
[0,0,0,0],
|
||||
[0,4,5,0],
|
||||
[0,3,1,0]
|
||||
]
|
||||
</pre>
|
Reference in New Issue
Block a user