gist for leetcode 724

pivotIndex.java

class Solution {
    public int pivotIndex(int[] nums) {
        int totalSum = 0, leftSum = 0;
        
        for(int n : nums) {
            totalSum += n;
        }
        
        for(int i = 0; i < nums.length; i++) {
            if(leftSum == totalSum - leftSum - nums[i]) {
                return i;
            }
            
            leftSum += nums[i];
        }
        
        return -1;
    }
}