本文介绍了一种解决两数之和问题的有效算法。通过先排序再使用双指针技术来寻找数组中两个数相加等于特定目标值的组合。该方法避免了全排列搜索，显著提高了效率。
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
int *num = new int[N];
for (int i = 0; i < N; i++)
{
scanf("%d",&num[i]);
}
sort(num,num+N);
int mark = N-1;
for (int i = 0; i < N; i++)
{
for (int j = mark; j >i; j--)
{
if (num[i] + num[j] == M)
{
printf("%d %d\n", num[i], num[j]);
return 0;
}
else if (num[i] + num[j] > M)
mark = j;
else if (num[i] + num[j] < M)
break;
}
}
cout << "No Solution\n";
return 0;
}
#include<algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
int *num = new int[N];
for (int i = 0; i < N; i++)
{
scanf("%d",&num[i]);
}
sort(num,num+N);
int mark = N-1;
for (int i = 0; i < N; i++)
{
for (int j = mark; j >i; j--)
{
if (num[i] + num[j] == M)
{
printf("%d %d\n", num[i], num[j]);
return 0;
}
else if (num[i] + num[j] > M)
mark = j;
else if (num[i] + num[j] < M)
break;
}
}
cout << "No Solution\n";
return 0;
}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
