leetcode

0 class Solution {

1 public:

2 int largestOverlap(const vector<vector<int>> &img1, const vector<vector<int>> &img2) {

3 const int n = img1.size();

4 vector<int> one, two;

5 unordered_map<int, int> count;

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

7 for (int j = 0; j < n; j++) {

8 if (img1[i][j]) one.push_back(i * 100 + j);

9 if (img2[i][j]) two.push_back(i * 100 + j);

10 }

11 }

12

13 for (int i : one)

14 for (int j : two)

15 count[i - j]++;

16

17 int res = 0;

18 for (auto it : count)

19 res = max(res, it.second);

20 return res;

21 }

22 };