题解 | #牛群保卫战#

#include <climits>
#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param target int整型 
     * @param nums int整型vector 
     * @return int整型
     */
    int findMinSubarrayLength(int target, vector<int>& nums) {
        // write code here
        vector<int> presum = vector<int>(nums.size()+1);
        for (int i = 0; i < nums.size(); i++) {
            presum[i+1] = presum[i] + nums[i];
        }
        int ans = INT_MAX;
        for (int i = 0; i <= nums.size(); i++) {
            for (int j = i+1; j <= nums.size() && j - i < ans; j++) {
                if (presum[j]-presum[i] >= target) {
                    ans = j-i;
                    break;
                }
            }
        }
        return ans == INT_MAX? 0 :ans;
    }
};