You are given two images `img1`

and `img2`

both of size `n x n`

, represented as binary, square matrices of the same size. (A binary matrix has only 0s and 1s as values.)

We translate one image however we choose (sliding it left, right, up, or down any number of units), and place it on top of the other image. After, the *overlap* of this translation is the number of positions that have a 1 in both images.

(Note also that a translation does **not** include any kind of rotation.)

What is the largest possible overlap?

**Example 1:**

Input:img1 = [[1,1,0],[0,1,0],[0,1,0]], img2 = [[0,0,0],[0,1,1],[0,0,1]]Output:3Explanation:We slide img1 to right by 1 unit and down by 1 unit. The number of positions that have a 1 in both images is 3. (Shown in red)

**Example 2:**

Input:img1 = [[1]], img2 = [[1]]Output:1

**Example 3:**

Input:img1 = [[0]], img2 = [[0]]Output:0

**Constraints:**

`n == img1.length`

`n == img1[i].length`

`n == img2.length`

`n == img2[i].length`

`1 <= n <= 30`

`img1[i][j]`

is`0`

or`1`

.`img2[i][j]`

is`0`

or`1`

.

```
struct Solution;
impl Solution {
fn largest_overlap(a: Vec<Vec<i32>>, b: Vec<Vec<i32>>) -> i32 {
let n = a.len();
let mut res = 0;
for i in 0..n {
for j in 0..n {
res = res.max(Self::translate(i, j, &a, &b, n));
res = res.max(Self::translate(i, j, &b, &a, n));
}
}
res
}
fn translate(x: usize, y: usize, a: &[Vec<i32>], b: &[Vec<i32>], n: usize) -> i32 {
let mut res = 0;
for i in 0..n {
for j in 0..n {
if i + x < n && j + y < n {
res += a[i + x][j + y] * b[i][j];
}
}
}
res
}
}
#[test]
fn test() {
let a = vec_vec_i32![[1, 1, 0], [0, 1, 0], [0, 1, 0]];
let b = vec_vec_i32![[0, 0, 0], [0, 1, 1], [0, 0, 1]];
let res = 3;
assert_eq!(Solution::largest_overlap(a, b), res);
}
```