找数组的中心索引 - lifengyu360/lifengyu_first_git_test GitHub Wiki

int pivotIndex(vector<int>& nums) {

    vector<int> all;
    int total = 0;

    for (int i = 0; i< nums.size(); i++){
        total += nums[i];
        all.push_back(total);
    }
    int max_index = all.size() - 1;
    if (all[max_index]- all[0] == 0) return 0;
 

    for (int i = 1; i < all.size(); i++){
        if (all[i-1] == (all[max_index] - all[i]) ) {
            return i;
        }
    }
    if (all[max_index - 1] == 0) return max_index;
    return -1;
}