数组平衡点

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int FindBalancePoint(vector<int> &vec)
{
    int leftsum = 0;
    int rightsum = 0;
    for(int i=1 ; i<vec.size() ;i++)
        rightsum += vec[i];
    int cnt = 0;
    for(int j=0; j<vec.size() ; j++)
    {
        if(leftsum == rightsum)
        {
            cnt++;
            cout <<"success :" <<vec[j] <<endl;
        }
        leftsum += vec[j];
        if( j<vec.size()-1)
            rightsum -= vec[j+1];
        else
            rightsum -= 0;
    }
    return cnt;
}

int main()
{
    int a[3] = {11,-11,11};
    vector<int> vec;
    vec.assign(a,a+3);
    FindBalancePoint(vec);
    return 0;
}