leetcode

0 class Solution {

1 public:

2 vector<vector<int>> imageSmoother(vector<vector<int>> &img) const {

3 const int n = img.size() - 1;

4 const int m = img[0].size() - 1;

5 for (int i = 0; i <= n; i++) {

6 for (int j = 0; j <= m; j++) {

7 int sum = 0, count = 0;

8 for (int k = max(i - 1, 0); k <= min(i + 1, n); k++) {

9 for (int l = max(j - 1, 0); l <= min(j + 1, m); l++) {

10 sum += img[k][l] & 0xFF;

11 count++;

12 }

13 }

14 img[i][j] |= (sum / count) << 8;

15 }

16 }

17 for (int i = 0; i <= n; i++) {

18 for (int j = 0; j <= m; j++) {

19 img[i][j] >>= 8;

20 }

21 }

22 return img;

23 }

24 };