19 - 724. Find Pivot Index

class Solution {
    public int pivotIndex(int[] nums) {
        int prefixSum = nums[0];
        int suffixSum = nums[nums.length-1];
        for(int i=0;i<nums.length;i++){
            if(i!=0){
                prefixSum = prefixSum + nums[i];
            }
            int index = (i+nums.length-1)%(nums.length);
            if(index<nums.length-1){
               
                suffixSum = suffixSum + nums[index];
            }

            if(prefixSum ==suffixSum){
                return i;
            }
        }
        
        return -1;
        
    }
}