java 연속 된수

import java.util.Scanner; public class MaximumLengthContinuousSubsequence { public static int solution(int n, int k, int[] bins) { int answer = 0, lt = 0, convertCnt = 0; for (int rt = 0; rt k) { if (bins[lt] == 0) convertCnt--; lt++; } answer = Math.max(answer, rt - lt + 1); } return answer; } public static void main(String[] arg..