1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 19:46:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions

View File

@@ -0,0 +1,35 @@
<p>编写一种算法若M × N矩阵中某个元素为0则将其所在的行与列清零。</p>
<p>&nbsp;</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>