/*************************************************
题目:11. 递增数组中查找和为n的一对数
思路:设置头尾指针,比较两者指向的数之和与sum的大小
****************************************************/
#include"stdafx.h"
#include<iostream>
using namespace std;
bool FindNums(int arr[],int len,int sum)
{
bool notfound = true;
if(arr == NULL || len <1)
return notfound;
int *pHead = arr;
int *pLast = arr+len-1;
while(pHead < pLast)
{
long long cursum = *pHead + *pLast;
if(cursum == sum)
{
notfound =true;
cout << *pHead <<" "<<*pLast <<endl;
break;
}
else if(cursum < sum)
{
pHead++;
}
else
pLast--;
}
return notfound;
}
int main()
{
int arr[8] = {1,3,4,5,6,8,11,13};
int sum = 18;
cout << FindNums(arr,8,18) << endl;
system("pause");
return 0;
}
</pre><pre name="code" class="cpp">/******************************数组——背包问题***************************************
题目:求数组和为定值n的m个数
思路:典型的背包问题
采用
**********************************************************************/
#include"stdafx.h"
#include<iostream>
#include<assert.h>
#include<list>
using namespace std;
list<int> ilist;
void Find_factor(int sum,int n)
{
//递归出口
if(sum <= 0|| n <= 0)
return ;
if(sum == n)//要放的数刚好是满足条件的最后一个数
{
for(list<int>::iterator iter = ilist.begin(); iter != ilist.end(); iter++)
cout << *iter << "+";
cout << n <<endl;
}
ilist.push_back(n);
Find_factor(sum-n,n);
ilist.pop_back();
Find_factor(sum,n-1);
}
int main()
{
int sum, n;
cout << "请输入你要等于多少的数值 sum:" << endl;
cin >> sum;
cout << "请输入你要从 1.....n 数列中取值的 n:" << endl;
cin >> n;
cout << "所有可能的序列,如下:" << endl;
Find_factor(sum,n);
system("pause");
return 0;
}