LeetCode Hot100 560.和为K的子数组

暴力

class Solution {
public:
    int subarraySum(vector<int>& nums, int k) {
        int sum = 0, res = 0;
        int left = 0, right = 0;
        while(left < nums.size()){
            sum = 0;
            sum += nums[left];
            if(sum == k) res++;
            right = left + 1;
            if(right == nums.size()) {
                left++;
                continue;
            }
            sum += nums[right++];
            if(sum == k) res++;
            while(right < nums.size()){
                sum += nums[right++];
                if(sum == k) res++;
            }
            left++;
        }
        return res;
    }
};