/*************************************************************************************
**在排序数组中找和为s的两个数字,输出任意一组***********************************
**方法:设置首位两个指针,将其指向的值相加的和与sum比较,根据情况移动指针
**************************************************************************************/
bool FindNumbersWithSum(int data[], int length, int sum, int* num1, int* num2)
{
bool found = false;
if(length < 1 || num1 == NULL || num2 ==NULL)
return found;
int ahead=length-1;
int behind = 0;
while(ahead > behind)
{
long long curSum = data[ahead] + data[behind];
if(curSum == sum)
{
*num1 = data[behind];
*num2 = data[ahead];
found = true;
break;
}
else if(curSum > sum)
ahead--;
else
behind++;
}
return found;
}
/*输入一个正数s,打印所有和为s的正数序列(至少含有两个数字)****
**例如输入15,由于1+2+3+4+5=4+5+6=7+8=15,所有打印结果为
**3个连续序列 1~5 、4~6、7~8************************************
方法:用两个数字small和big分别表示序列的最大值和最小值,首先将
small初始化为1,big初始化为2.如果从small到big的和大于s,我们就
从序列中去掉较小的值(即增大small),相反,只需要增大big。********
终止条件为:一直增加small到(1+s)/2为止***************************/
void FindContinuousSequence(int sum)
{
if(sum < 3)
return;
int small = 1;
int big = 2;
int middle = (1+ sum) / 2;
int curSum = small+big;
while(small < middle)
{
if(curSum == sum)
PrintContinusSequence(small, big);
while(curSum > sum && small < middle)
{
curSum -= small;
small++;
if(curSum == sum)
PrintContinusSequence(small, big);
}
big++;
curSum += big;
}
}
void PrintContinusSequence(int small, int big)
{
for(int i = small; i <= big; i++)
printf("%d", i);
printf("\n");
}