[cpp] Minimum Size Subarray Sum

Viewer

copydownloadembedprintName: Minimum Size Subarray Sum
  1. class Solution {
  2. public:
  3.     int minSubArrayLen(int target, vector<int>& nums) {
  4.         int l = 0, r = 0;
  5.         int ans = INT_MAX, sum = 0;
  6.         for (r = 0; r < nums.size(); r++) {
  7.             sum += nums[r];
  8.  
  9.             while (sum >= target && l <= r) {
  10.                 ans = min(ans, r - l + 1);
  11.                 sum -= nums[l];
  12.                 l++;
  13.             }
  14.         }
  15.  
  16.         if (ans == INT_MAX)
  17.             return 0;
  18.  
  19.         return ans;
  20.     }
  21. };

Editor

You can edit this paste and save as new:


File Description
  • Minimum Size Subarray Sum
  • Paste Code
  • 17 Apr-2024
  • 482 Bytes
You can Share it: