1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 11:21:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part2

This commit is contained in:
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions

View File

@@ -0,0 +1,37 @@
<p>Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0.</p>
<p>&nbsp;</p>
<p><strong>Example 1: </strong></p>
<pre>
<strong>Input: </strong>
[
[1,1,1],
[1,0,1],
[1,1,1]
]
<strong>Output: </strong>
[
[1,0,1],
[0,0,0],
[1,0,1]
]
</pre>
<p><strong>Example 2: </strong></p>
<pre>
<strong>Input: </strong>
[
[0,1,2,0],
[3,4,5,2],
[1,3,1,5]
]
<strong>Output: </strong>
[
[0,0,0,0],
[0,4,5,0],
[0,3,1,0]
]
</pre>