【LeetCode】【数组和字符串】寻找数组的中心索引

class Solution {
    public int pivotIndex(int[] nums) {
        int sumLeft = 0;
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
        }

        for (int i = 0; i < nums.length; i++) {
            
            if (sumLeft == sum -nums[i] - sumLeft) {
                return i;
            }
            sumLeft += nums[i];
        }

        return -1;
    }
}