qq_19450921的博客

Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different task. Tasks could be done in any order. Each task is done in one unit of time. For each unit of time, the CPU could complete either one task

暴力解 class Solution { public int shortestSubarray(int[] A, int K) { int[] P = new int[A.length + 1]; for(int i = 0; i < A.length; i++){ P[i + 1] = P[i] + A[i]; ...