DataWhale02

724. 寻找数组的中心下标

 class Solution {
 public:
     int pivotIndex(vector<int>& nums) {
         int n = nums.size();
         int i = 0;
         for(i = 0; i < n; i++){
             int sumL = 0, sumR = 0;
             for(int j = 0; j < i; j++){
                 sumL += nums[j];
             }
             for(int m = i+1; m < n; m++){
                 sumR += nums[m];
             }
              if(sumL == sumR){
                 return i;
             }
         }
         return -1;
     }
 };