程式語言 - LeetCode - C - 724. Find Pivot Index

參考資訊：
https://www.cnblogs.com/cnoodle/p/13900751.html

題目：


解答：

int pivotIndex(int* nums, int numsSize)
{
    #define  MAX_SIZE 10001

    int i = 0;
    int l[MAX_SIZE] = { 0 };
    int r[MAX_SIZE] = { 0 };

    for (i = 1; i < (numsSize + 1); i++) {
        l[i] = l[i - 1] + nums[i - 1];
    }

    for (i = numsSize - 2; i >= 0; i--) {
        r[i] = r[i + 1] + nums[i + 1];
    }

    for (i = 0; i < numsSize; i++) {
        if (l[i] == r[i]) {
            return i;
        }
    }

    return -1;
}