问题描述:
返回 A 的最短的非空连续子数组的长度,该子数组的和至少为 K 。
如果没有和至少为 K 的非空子数组,返回 -1 。
示例 1:
输入:A = [1], K = 1 输出:1 示例 2:
输入:A = [1,2], K = 4 输出:-1 示例 3:
输入:A = [2,-1,2], K = 3 输出:3
提示:
1 <= A.length <= 50000
-10 ^ 5 <= A[i] <= 10 ^ 5 1 <= K <= 10 ^ 9来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/shortest-subarray-with-sum-at-least-k
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
参考源码:
int shortestSubarray(vector<int>& A, int K) {
int len = A.size();
int sum = 0, begin = 0, res = -1;
for (int i = 0; i < len; i++) {
if (A[i] >= K) return 1;
sum += A[i];
if (sum < 1) {
sum = 0;
begin = i + 1;
continue;
}
for (int j = i - 1; A[j + 1] < 0; j--) {
A[j] = A[j + 1] + A[j];
A[j + 1] = 0;
}
if (sum >= K) {
while (sum - A[begin] >= K || A[begin] <= 0)
sum -= A[begin++];
int length = i - begin + 1;
if (res < 0 || res > length)
res = length;
}
}
return res;
}
转自https://leetcode-cn.com/u/lietstart