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.
Input: nums = [1, 7, 3, 6, 5, 6] Output: 3 Explanation: The sum of the numbers to the left of index 3 (nums = 6) is equal to the sum of numbers to the right of index 3. Also, 3 is the first index where this occurs.
Input: nums = [1, 2, 3] Output: -1 Explanation: There is no index that satisfies the conditions in the problem statement.
numswill be in the range
nums[i]will be an integer in the range
Intuition and Algorithm\n
We need to quickly compute the sum of values to the left and the right of every index.\n
Let\'s say we knew
S as the sum of the numbers, and we are at index
i. If we knew the sum of numbers
leftsum that are to the left of index
i, then the other sum to the right of the index would just be
S - nums[i] - leftsum.
As such, we only need to know about
leftsum to check whether an index is a pivot index in constant time. Let\'s do that: as we iterate through candidate indexes
i, we will maintain the correct value of
Time Complexity: , where is the length of
Space Complexity: , the space used by
Analysis written by: @awice.\n