-
Notifications
You must be signed in to change notification settings - Fork 0
/
set_matrix_zeroes.cpp
266 lines (220 loc) · 6.17 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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
// Copyright (c) Omar Boukli-Hacene. All rights reserved.
// Distributed under an MIT-style license that can be
// found in the LICENSE file.
// SPDX-License-Identifier: MIT
#include "forfun/set_matrix_zeroes.hpp"
#include <cassert>
#include <vector>
namespace forfun::set_matrix_zeroes {
namespace iterator_based_sol1 {
auto set_zeroes(std::vector<std::vector<int>>& matrix) -> void
{
using DiffC = std::vector<std::vector<int>>::value_type::difference_type;
auto const matrix_begin{matrix.begin()};
auto const matrix_end{matrix.end()};
if (matrix_begin == matrix_end)
{
return;
}
if (matrix_begin->empty())
{
return;
}
auto const first_element_itr{matrix_begin->begin()};
bool is_first_col_zeroed{false};
for (auto itr_r{matrix_begin}; itr_r != matrix_end; ++itr_r)
{
assert(matrix_begin->size() == itr_r->size());
auto const itr_c_begin{itr_r->begin()};
auto const itr_c_end{itr_r->end()};
DiffC col_offset{0};
for (auto itr_c{itr_c_begin}; itr_c != itr_c_end; ++itr_c)
{
if (*itr_c == 0)
{
*itr_c_begin = 0;
if (col_offset == DiffC{0})
{
is_first_col_zeroed = true;
}
else
{
*(first_element_itr + col_offset) = 0;
}
}
++col_offset;
}
}
// Zero all columns, except for the first one.
for (auto itr_r{matrix_begin}; itr_r != matrix_end; ++itr_r)
{
auto const itr_c_end{itr_r->end()};
DiffC col_offset{1};
// clang-format off
for (auto itr_c{itr_r->begin() + col_offset}; itr_c != itr_c_end;
++itr_c)
// clang-format on
{
if (*(first_element_itr + col_offset) == 0)
{
*itr_c = 0;
}
++col_offset;
}
}
// Zero all rows.
for (auto itr_r{matrix_begin}; itr_r != matrix_end; ++itr_r)
{
if (itr_r->front() == 0)
{
auto const itr_c_end{itr_r->end()};
for (auto itr_c{itr_r->begin()}; itr_c != itr_c_end; ++itr_c)
{
*itr_c = 0;
}
}
}
if (is_first_col_zeroed)
{
// Zero first column.
for (auto itr{matrix_begin}; itr != matrix_end; ++itr)
{
*itr->begin() = 0;
}
}
}
} // namespace iterator_based_sol1
namespace iterator_based_sol2 {
auto set_zeroes(std::vector<std::vector<int>>& matrix) noexcept -> void
{
using DiffC = std::vector<std::vector<int>>::value_type::difference_type;
auto const matrix_begin{matrix.begin()};
auto const matrix_end{matrix.end()};
if (matrix_begin == matrix_end)
{
return;
}
if (matrix_begin->empty())
{
return;
}
auto const first_element_itr{matrix_begin->begin()};
bool is_first_col_zeroed{false};
for (auto itr_r{matrix_begin}; itr_r != matrix_end; ++itr_r)
{
assert(matrix_begin->size() == itr_r->size());
auto const itr_c_begin{itr_r->begin()};
auto const itr_c_end{itr_r->end()};
DiffC col_offset{0};
for (auto itr_c{itr_c_begin}; itr_c != itr_c_end; ++itr_c)
{
if (*itr_c == 0)
{
*itr_c_begin = 0;
if (col_offset == DiffC{0})
{
is_first_col_zeroed = true;
}
else
{
*(first_element_itr + col_offset) = 0;
}
}
++col_offset;
}
}
// Zero all rows and columns, except for the first ones.
for (auto itr_r{matrix_begin + 1}; itr_r != matrix_end; ++itr_r)
{
auto const itr_c_end{itr_r->end()};
auto const row_front{itr_r->front()};
DiffC col_offset{1};
for (auto itr_c{itr_r->begin() + 1}; itr_c != itr_c_end; ++itr_c)
{
if ((*(first_element_itr + col_offset) == 0) || (row_front == 0))
{
*itr_c = 0;
}
++col_offset;
}
}
if (*first_element_itr == 0)
{
// Zero first row.
auto const itr_c_end{matrix_begin->end()};
for (auto itr_c{first_element_itr + 1}; itr_c != itr_c_end; ++itr_c)
{
*itr_c = 0;
}
}
if (is_first_col_zeroed)
{
// Zero first column.
for (auto itr{matrix_begin}; itr != matrix_end; ++itr)
{
*itr->begin() = 0;
}
}
}
} // namespace iterator_based_sol2
namespace offset_based {
auto set_zeroes(std::vector<std::vector<int>>& matrix) noexcept -> void
{
using MatrixR = std::vector<std::vector<int>>;
using SizeTypeR = MatrixR::size_type;
using SizeTypeC = MatrixR::value_type::size_type;
auto const matrix_r_size{matrix.size()};
if (matrix_r_size == SizeTypeR{0U})
{
return;
}
auto const matrix_c_size{matrix.begin()->size()};
if (matrix_c_size == SizeTypeC{0U})
{
return;
}
bool is_col_zeroed{false};
for (SizeTypeR r{0U}; r < matrix_r_size; ++r)
{
assert(matrix[r].size() == matrix_c_size);
for (SizeTypeC c{0U}; c < matrix_c_size; ++c)
{
if (matrix[r][c] == 0)
{
matrix[r][0] = 0;
if (c == 0)
{
is_col_zeroed = true;
continue;
}
matrix[0][c] = 0;
}
}
}
for (SizeTypeR r{1U}; r < matrix_r_size; ++r)
{
for (SizeTypeC c{1U}; c < matrix_c_size; ++c)
{
if ((matrix[r][0] == 0) || (matrix[0][c] == 0))
{
matrix[r][c] = 0;
}
}
}
if (matrix[0][0] == 0)
{
for (SizeTypeC c{1U}; c < matrix_c_size; ++c)
{
matrix[0][c] = 0;
}
}
if (is_col_zeroed)
{
for (SizeTypeR r{0U}; r < matrix_r_size; ++r)
{
matrix[r][0] = 0;
}
}
}
} // namespace offset_based
} // namespace forfun::set_matrix_zeroes