forked from rost0413/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSet_Matrix_Zeroes.cpp
75 lines (68 loc) · 1.46 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
/*
Author: Weixian Zhou, ideazwx@gmail.com
Date: Jul 18, 2012
Problem: Set Matrix Zeroes
Difficulty: easy
Source: http://www.leetcode.com/onlinejudge
Notes:
Given a m x n matrix, if an element is 0, set its entire row and column to 0.
Do it in place.
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:
*/
#include <vector>
#include <set>
#include <climits>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
using namespace std;
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
int n = matrix.size();
int m = (n != 0 ? matrix[0].size() : 0);
int x = -1, y = -1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (!matrix[i][j]) {
if (x == -1) {
x = i;
y = j;
}
matrix[x][j] = 0;
matrix[i][y] = 0;
}
}
}
if (x == -1) {
return;
}
for (int i = 0; i < n; i++) {
if (!matrix[i][y] && i != x) {
for (int j = 0; j < m; j++) {
matrix[i][j] = 0;
}
}
}
for (int i = 0; i < m; i++) {
if (!matrix[x][i] && i != y) {
for (int j = 0; j < n; j++) {
matrix[j][i] = 0;
}
}
}
for (int i = 0; i < n; i++) {
matrix[i][y] = 0;
}
for (int i = 0; i < m; i++) {
matrix[x][i] = 0;
}
}
};