724. 寻找数组的中心下标
题目链接
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/find-pivot-index/
题目描述
题目分析
左右的值都加上了当前下标的值。
class Solution {
public:
int pivotIndex(vector<int>& nums) {
int n = nums.size();
int sum = 0;
for(int num : nums){
sum += num;
}
int leftSum = 0, rightSum = 0;
for(int i = 0;i < n; i++){
leftSum += nums[i];
rightSum = sum - leftSum + nums[i];
if(leftSum == rightSum) return i;
}
return -1;
}
};