和为某一值的连续正序列

void print(int* nums, int left, int right)
{
for(int i= left; i<= right; ++i)
{
cout<<nums[i]<<",";
}
cout<<endl;
}

void FindAllNumsWithSum(int* nums, int start, int end, int k)
{
if(nums == NULL || end < 1 || k < 3)
{
return ;
}

int MiddleIndex  =(start + end)/2;
int MiddleData = nums[MiddleIndex];

if(MiddleData >= k)
{
end = MiddleIndex - 1;
//FindNumsWithSum(nums, start, end, k);
}

else
{
int left = start;
int right = end;

int middle = (1 + k)/2;
int CurSum = nums[left] + nums[right];

while(left < middle)
{
if(CurSum == k)
{
print(nums, left ,right);
}
while(CurSum > k && left < middle)
{
CurSum -=nums[left];
left++;

if(CurSum == k)
{
print(nums, left, right);
}
}

right++;
CurSum += nums[right];

}
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int Array[] = {1,2,4,7,11,15};
int len = sizeof(Array)/sizeof(int);

int k = 15;

FindNumsWithSum(Array, 0, len -1, k);
getchar();
return 0;
}