Find Pivot Index[Leetcode 724]

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/cyrususie/article/details/78694557

Ans

---

#include <iostream>

using namespace std;
class Solution {
public:
    int pivotIndex(vector<int>& nums) {
        int lsum = 0;
        int rsum = 0;
        int sum = 0;
        int len = nums.size();
        for (int i = 0; i < len; i++) {
            sum += nums[i];
        }
        for (int i = 0; i < len; i++) {
            if (i != 0) {
                lsum += nums[i-1];
                rsum = sum - lsum - nums[i];
                if (lsum == rsum) return i;
            } else {
                rsum = sum - nums[i];
                if (rsum == 0) return 0;
            }
        }
        return -1;
    }
};