public class DayCode {    public static void main(String[] args) {        int[] customers = new int[]{1,0,1,2,1,1,7,5};        int[] grumpy = new int[]{0,1,0,1,0,1,0,1};        int X = 3;        int ans = new DayCode().maxSatisfied(customers, grumpy, X);        System.out.println("ans is " + ans);    }
    /**     * https://leetcode-cn.com/problems/grumpy-bookstore-owner/     * 时间复杂度O(n)     * 空间复杂度O(1)     * @param customers     * @param grumpy     * @param X     * @return     */    public int maxSatisfied(int[] customers, int[] grumpy, int X) {        int ans = 0;        int n = customers.length;        int sum = 0;        for (int i = 0; i < n; i++) {            if (grumpy[i] == 0) {                sum += customers[i];            }        }        int increase = 0;        for (int j = 0; j < X; j++) {            increase += customers[j] * grumpy[j];        }        int maxIncrease = increase;        for (int k = X; k < n; k++) {            increase = increase - customers[k - X] * grumpy[k - X] + customers[k] * grumpy[k];            maxIncrease = Math.max(increase, maxIncrease);        }        ans = sum + maxIncrease;        return ans;    }}