You are given an integer array forts of length n representing the state of forts along a line:

• forts[i] = $-1$ indicates that position i is empty.

• forts[i] = $0$ indicates that position i contains an enemy fort.

• forts[i] = $1$ indicates that position i contains a fort under your command.

You want to move your army from a fort under your command at position i to an empty fort at position j such that every position strictly between i and j contains an enemy fort. That is, for every index k where $\min(i, j) < k < \max(i, j)$, forts[k] = $0$.

All enemy forts between i and j are captured during this movement.

Return the maximum number of enemy forts that can be captured. If no movement is possible, return $0$.

Constraints:

• $1 \leq$ forts.length $\leq 1000$

• $-1 \leq$ forts[i] $\leq 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.