diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/image_overlap.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/image_overlap.cpp')
-rw-r--r-- | other/image_overlap.cpp | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/other/image_overlap.cpp b/other/image_overlap.cpp new file mode 100644 index 0000000..bc6eeba --- /dev/null +++ b/other/image_overlap.cpp @@ -0,0 +1,23 @@ +#include "leetcode.h" + +class Solution { +public: + int largestOverlap(vvd & img1, vvd & img2) { + vector<int> la, lb; + int n = img1.size(); + unordered_map<int, int> count; + for (int i = 0; i < n * n; ++i) + if (img1[i / n][i % n] == 1) + la.push_back(i / n * 100 + i % n); + for (int i = 0; i < n * n; ++i) + if (img2[i / n][i % n] == 1) + lb.push_back(i / n * 100 + i % n); + for (int i : la) + for (int j : lb) + count[i - j]++; + int ans = 0; + for (auto it : count) + ans = max(ans, it.second); + return ans; + } +}; |