WebClub codebuddy

MinimumSizeSubarraySum.cpp

class Solution {
public:
    int minSubArrayLen(int s, vector<int>& nums) {
        
        int min=nums.size()+1;
        int i=0,j=0;
        int sum=0;
        for(i=0;i<nums.size();i++){
            if(nums[i]>=s){
                min=1;
                break;
            }
            else{
                sum=sum+nums[i];
                while(sum>=s){
                    int x=i-j+1;
                    if(x<min){
                        min=x;
                    }
                    sum=sum-nums[j];
                    j++;
                }
                
            }
            
        }
        
        if(min==nums.size()+1){
            return 0;
        }
        
        return min;
        
    }
};