-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSet_Matrix_zeroes.cpp
97 lines (84 loc) · 1.52 KB
/
Set_Matrix_zeroes.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/*
Problem:
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
click to show follow up.
Follow up:
Did you use extra space?
A straight forward solution using O(mn) space is probably a bad idea.
A simple improvement uses O(m + n) space, but still not the best solution.
Could you devise a constant space solution?
*/
/*
Solution:
http://blog.csdn.net/fightforyourdream/article/details/14220585
*/
#include<iostream>
#include<vector>
using namespace std;
void setZeroes(vector<vector<int>> &matrix)
{
bool rowZero = false;
bool colZero = false;
for (int i = 0; i < matrix.size(); i++)
{
if (matrix[i][0] == 0)
{
colZero = true;
break;
}
}
for (int j = 0; j < matrix[0].size(); j++)
{
if (matrix[0][j] == 0)
{
rowZero = true;
break;
}
}
// 标记对应第一行与第一列的元素为0
for (int i = 1; i < matrix.size(); i++)
{
for (int j = 1; j < matrix[i].size(); j++)
{
if (matrix[i][j] == 0)
{
matrix[0][j] = 0;
matrix[i][0] = 0;
}
}
}
for (int i = 1; i < matrix.size(); i++)
{
if (matrix[i][0] == 0)
{
for (int j = 0; j < matrix[i].size(); j++)
{
matrix[i][j] = 0;
}
}
}
for (int j = 1; j < matrix[0].size(); j++)
{
if (matrix[0][j] == 0)
{
for (int i = 0; i < matrix.size(); i++)
{
matrix[i][j] = 0;
}
}
}
if (rowZero)
{
for (int j = 0; j < matrix[0].size(); j++)
{
matrix[0][j] = 0;
}
}
if (colZero)
{
for (int i = 0; i < matrix.size(); i++)
{
matrix[i][0] = 0;
}
}
}