#include<iostream>
#include<vector>
#include<string>
using namespace std;
int find(vector<int>& inputarray){
int sum = 0;
int length = inputarray.size();
for (int i : inputarray){
sum += i;
}
int r = sum - inputarray[0];
int l = 0;
for (int i = 0; i < length - 1; ++i){
l += inputarray[i];
r -= inputarray[i + 1];
if (l == r){
return i+1;
break;
}
}
}
int main(){
vector<int> a = {1,2,3,4,6};
cout<<find(a);
system("pause");
return 0;
}
平衡点问题(shoppee笔试题)
最新推荐文章于 2023-12-27 13:14:28 发布