LeetCode - Find Pivot Index

문제 설명

Given an array of integers nums, calculate the pivot index of this array.

The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index's right.

If the index is on the left edge of the array, then the left sum is 0 because there are no elements to the left. This also applies to the right edge of the array.

Return the leftmost pivot index. If no such index exists, return -1.

입출력 예시

Example 1:

Input: nums = [1,7,3,6,5,6]
Output: 3
Explanation:
The pivot index is 3.
Left sum = nums[0] + nums[1] + nums[2] = 1 + 7 + 3 = 11
Right sum = nums[4] + nums[5] = 5 + 6 = 11

제약사항

1 <= nums.length <= 104
-1000 <= nums[i] <= 1000

Solution

class Solution {
    public int pivotIndex(int[] nums) {

        int total = 0;
        for (int i = 0; i < nums.length; i++) {
            total += nums[i];
        }

        int leftSum = 0;
        int rightSum = total;
        for (int i = 0; i < nums.length; i++) {
            rightSum -= nums[i];
            if (leftSum == rightSum) {
                return i;
            }
            leftSum += nums[i];
        }
        return -1;
    }
}