-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathZeroMatrix.cpp
93 lines (76 loc) · 1.69 KB
/
ZeroMatrix.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
//
// main.cpp
// InterviewPrep
//
// Created by Clifton Gordon on 11/24/15.
// Copyright © 2015 Clifton Gordon. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
void PrintMatrix(vector<vector<int>> &M)
{
for (int i = 0; i < M.size(); i++)
{
for (int j = 0; j < M[i].size(); j++)
{
printf ("%d ", M[i][j]);
}
printf ("\n");
}
printf("\n");
}
void ZeroMatrix(vector<vector<int>> &M)
{
int rows = M.size();
if (rows <= 0)
return;
int cols = M[0].size();
bool markRows[rows];
for (int i = 0; i < rows; i++)
markRows[i] = false;
bool markCols[cols];
for (int j = 0; j < cols; j++)
markCols[j] = false;
for (int i = 0; i < rows; i++)
{
for (int j = 0; j < cols; j++)
{
if (M[i][j] == 0)
{
markRows[i] = true;
markCols[j] = true;
}
}
}
for (int i = 0; i < rows; i++)
{
if (markRows[i])
{
for (int j = 0; j < cols; j++)
M[i][j] = 0;
}
}
for (int j = 0; j < cols; j++)
{
if (markCols[j])
for (int i = 0; i < rows; i++)
M[i][j] = 0;
}
}
int main(int argc, const char * argv[]) {
int rows = rand() % 10 + 1;
int cols = rand() % 10 + 1;
vector<vector<int>> m(rows, vector<int>(cols));
for (int i = 0; i < rows; i++)
{
for (int j = 0; j < cols; j++)
{
m[i][j] = rand() % 10;
}
}
PrintMatrix(m);
ZeroMatrix(m);
PrintMatrix(m);
return 0;
}