深信服笔试9.14 c++第一题力扣原题,为啥输出只有20%
#include <iostream>
#include <algorithm>
using namespace std;
int Num(int v[], int len)
{
int ret = 0;
sort(v, v + len - 1);
for (int i = len - 1; i >= 2; i--)
{
int right = i - 1;
int left = 0;
while (left < right)
{
int sum = v[left] + v[right];
if (sum > v[i])
{
ret += (right - left);
right--;
}
else
{
left++;
}
}
}
return ret;
}
int main()
{
int n;
cin >> n;
int v[100];
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
int sum = Num(v,n);
cout << sum << endl;
return 0;
}
#笔试##深信服##笔经#
#include <algorithm>
using namespace std;
int Num(int v[], int len)
{
int ret = 0;
sort(v, v + len - 1);
for (int i = len - 1; i >= 2; i--)
{
int right = i - 1;
int left = 0;
while (left < right)
{
int sum = v[left] + v[right];
if (sum > v[i])
{
ret += (right - left);
right--;
}
else
{
left++;
}
}
}
return ret;
}
int main()
{
int n;
cin >> n;
int v[100];
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
int sum = Num(v,n);
cout << sum << endl;
return 0;
}
#笔试##深信服##笔经#