2511. Maximum Enemy Forts That Can Be Captured 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
    public int captureForts(int[] forts) {
        int maxCount = 0;

        int lastIndex = -1;
        for (int i = 0; i < forts.length; i++) {
            if (forts[i] != 0) {
                if (lastIndex != -1 && forts[i] != forts[lastIndex]) {
                    maxCount = Math.max(maxCount, i - lastIndex - 1); // 注意中间的元素个数为索引差再减去 1
                }
                lastIndex = i;
            }
        }

        return maxCount;
    }
}

References

2511. Maximum Enemy Forts That Can Be Captured