Finding the pivot index

class Solution {
public:
    int pivotIndex(vector<int>& nums) {
        int leftSum=0;
        int n=nums.size();
        int total=0;
        for(int i=0;i<n;i++){
            total += nums[i];
        }
        for(int i=0;i<n;i++){
            int rightSum = total - nums[i] - leftSum;
            if(leftSum == rightSum){
                return i;
            }
            leftSum += nums[i];
        }
        return -1;
    }
};