📚 4.长度最小的子数组

💻 代码实现

/**
 * @url https://leetcode.cn/problems/minimum-size-subarray-sum/
 */
function minSubArrayLen(target: number, nums: number[]): number {
    let left = 0,
        res = Number.MAX_SAFE_INTEGER,
        sum = 0
    for (let i = 0; i < nums.length; i++) {
        sum += nums[i]
        while (sum >= target) {
            res = Math.min(i - left + 1, res)
            sum -= nums[left++]
        }
    }
    return res === Number.MAX_SAFE_INTEGER ? 0 : res
}