题解 | #获得最多的奖金#双指针
获得最多的奖金
http://www.nowcoder.com/practice/247f7bd088764aefa7474cff27489095
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n;
while(cin >>n)
{
vector<int> nums(n);
for(int i = 0; i < n; i++)
{
cin >> nums[i];
}
int i = 0, j = n-1;
long long left = 0, right = 0;
long long res = 0;
if(n <= 1)
{
cout << 0 << endl;
continue;
}
while(i <= j)
{
if(left <= right)
{
if(left == right)
res = left;
left += nums[i];
i++;
}
else
{
right += nums[j];
j--;
}
}
if(left == right)
res = left;
cout << res << endl;
}
}
华为成长空间 540人发布
投递华为等公司10个岗位 >
