JAVA_LeetCode 2511_Maximum Enemy Forts That Can Be Captured

JAVA_LeetCode 2511_Maximum Enemy Forts That Can Be Captured 풀이 class Solution { public int captureForts(int[] forts) { // 시작 위치를 찾은 다음, 최대값을 도출한다. int prev = -2, pos = 0, max = 0; for(int i = 0; i < forts.length; i++){ if(forts[i] == 1 || forts[i] == -1){ if(prev == -2){ prev = forts[i]; pos = i; }else if(prev != forts[i]){ max = Math.max(max, i - pos - 1); prev = forts[i]; pos = i; }else pos = i; } } return max; } } * 출처 https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured...