-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleetcode2536.cpp
76 lines (72 loc) · 2.23 KB
/
leetcode2536.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
/*************************************************
Author: wenhaofang
Date: 2023-05-08
Description: leetcode2536 - Increment Submatrices by One
*************************************************/
#include <bits/stdc++.h>
using namespace std;
/**
* 方法一:差分矩阵
*
* 理论时间复杂度:O(n * n)
* 理论空间复杂度:O(n * n)
*/
class Solution {
public:
vector<vector<int>> rangeAddQueries(int n, vector<vector<int>>& queries) {
vector<vector<int>> nums(n, vector<int>(n));
vector<vector<int>> diff(n, vector<int>(n));
for (vector<int> query: queries) {
diff[query[0]][query[1]] += 1;
if (query[3] + 1 < n) {
diff[query[0]][query[3] + 1] -= 1;
}
if (query[2] + 1 < n) {
diff[query[2] + 1][query[1]] -= 1;
}
if (
query[2] + 1 < n &&
query[3] + 1 < n
) {
diff[query[2] + 1][query[3] + 1] += 1;
}
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < n; i++) {
if (i == 0) {
nums[i][j] = diff[i][j];
} else {
nums[i][j] = nums[i - 1][j] + diff[i][j];
}
}
}
for (int i = 0; i < n; i++) { // 这里是 nums
for (int j = 0; j < n; j++) {
if (j == 0) {
nums[i][j] = nums[i][j];
} else {
nums[i][j] = nums[i][j - 1] + nums[i][j];
}
}
}
return nums;
}
};
/**
* 测试
*/
int main() {
Solution* solution = new Solution();
int n = 3;
vector<vector<int>> queries = {
{1, 1, 2, 2},
{0, 0, 1, 1}
};
vector<vector<int>> ans = solution -> rangeAddQueries(n, queries);
for (vector<vector<int>>::iterator outer_iter = ans.begin(); outer_iter != ans.end(); outer_iter++) {
for (vector<int>::iterator inner_iter = (*outer_iter).begin(); inner_iter != (*outer_iter).end(); inner_iter++) {
cout << (*inner_iter) << " ";
}
cout << "\n";
}
}