724. Find Pivot Index.java

/**
Given an array of integers nums, write a method that returns the "pivot" index of this array.

We define the pivot index as the index where the sum of the numbers to the left of the index is equal to the sum of the numbers to the right of the index.

If no such index exists, we should return -1. If there are multiple pivot indexes, you should return the left-most pivot index.

Example 1:

Input: 
nums = [1, 7, 3, 6, 5, 6]
Output: 3
Explanation: 
The sum of the numbers to the left of index 3 (nums[3] = 6) is equal to the sum of numbers to the right of index 3.
Also, 3 is the first index where this occurs.
 

Example 2:

Input: 
nums = [1, 2, 3]
Output: -1
Explanation: 
There is no index that satisfies the conditions in the problem statement.

Algorithm:
Add all the elements in the array to totalSum
Loop through all elements and if sum of left side is equal to sum of total sum - left Side sum excludin
**/

class Solution {
    public int pivotIndex(int[] nums) {
        int totalSum =0;
        int sum =0;
        for(int i =0;i<nums.length;i++){
        totalSum += nums[i];    
        }
        for(int j=0; j<nums.length;j++){
            if(totalSum - sum-nums[j] == sum)
                return j;
            else
                sum += nums[j];
        }
        return -1;
    }
}