promotion for 35 years coder-Day04-求数组中两边和相等的位置

#include <iostream>

using namespace std;

int find_balance(int* array, int len)
{
    int sum = 0;
    for (int i = 0; i < len; i++)
    {
        sum += array[i];
    }

    int partSum = 0;
    for (int i = 0; i < len; i++)
    {
        if (partSum + array[i] == sum - partSum)
        {
            return i;
        }

        partSum += array[i];
    }

    return -1;
}

int main()
{
    int array1[] = {0, 1,-1,2,-2};
    int array2[] = {1,2,3,6,-11,0,8,4,-6,-5};

    int res = find_balance(array1, 5);
    cout << "first array: pos is " << res << endl;

    res = find_balance(array2, 10);
    cout << "second array: pos is " << res << endl;

    return 0;
}