思路:
for循环从1遍历到n-1,在嵌套一个for循环来遍历每一项与其他项的连续和,在遍历的过程中用if语句判断和是否为k即可。**(重点是要注意题干是连续的子数组,不是普通的子数组)*
#include <iostream>
using namespace std;
#include "string.h"
#include "stdlib.h"
#include "stdio.h"
#define N 30
int k = 0;
int size = 0;
int i = 0;
int subarraySum(int *nums, int k){
int res = 0;
int size = i;
//int size = sizeof(nums)/sizeof(int), res = 0;
for (int i = 0; i <size+1; ++i) {
int sum = 0;
for (int j = i; j <=size+1; ++j) {
sum += nums[j];
res += sum == k ? 1 : 0;
}
}
return res;
}
int main()
{
int cishu = 0;
int arr[N];
char s=' ';
printf("输入:");
while (s != '\n')
{
if (s == ',')
{
i++;
}
scanf_s("%d", &arr[i]);
s = getchar();//来接受是否是回车
}
scanf_s("%d", &k);
//for (int i=0;i<j;i++)
//{
// printf("%d", arr[i]);
//}
cishu = subarraySum(arr, k);
printf("%d",cishu);
}