class Solution {
public:
    int minSubArrayLen(int target, vector<int>& nums) {
        vector<int> preFix(nums.size() + 1, 0);

        int sum = 0;
        for (int i = 0; i < nums.size(); i++) {
            sum += nums[i];
            preFix[i + 1] = sum;
        }

        if (sum < target)
            return 0;

        int ans = nums.size();

        for (int len = 1; len <= nums.size(); len++) {
            for (int i = 0; i + len < preFix.size(); i++) {
                int j = i + len;

                if (preFix[j] - preFix[i] >= target) {
                    ans = len;
                    goto out;
                }
            }
        }

out:
        return ans;
    }
};