인프런 커뮤니티 질문&답변

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int k = sc.nextInt();
        sc.nextLine();

        int[] array = new int[N];
        for (int i = 0; i < array.length; i++) {
            array[i] = sc.nextInt();
        }
        sc.nextLine();

        Main main = new Main();
        int result = main.solution(array, k);

        System.out.println(result);
    }

    private int solution(int[] array, int k) {
        int lt = 0;
        int answer = 0;
        int count = 0;

        for (int rt = 0; rt < array.length; rt++) {
            if (array[rt] == 0)
                count++;

            while (count > k) {
                if (array[lt] == 0) {
                    count--;
                }
                lt++;
            }

            answer = Math.max(answer, rt - lt + 1);
        }

        return answer;
    }
}