- 724 Find Pivot Index Easy 3835 433 Add To List Share Given An Array Of Integers Nums Calculate The Pivot Index Of This 1 (45.38 KiB) Viewed 24 times
MY CODE:
class Solution {public: int pivotIndex(vector<int>& nums) { //iterate through and find sum of allnums int sum = 0; for (int i = 0; i < nums.size();i++) { sum += nums.at(i); } //iterate through and keep track ofleftsum and sum-leftsum to find rightsum int leftsum = 0; int rightsum = 0; for (int i = 0; i < nums.size();i++) { leftsum +=nums.at(i); rightsum = sum -leftsum; if (leftsum ==rightsum) { returnnums.at(i); } } return 0; }};
724. Find Pivot Index Easy 3835 433 Add to List Share 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 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 Example 2: Input: nums = [1,2,3] Output: -1 Explanation: There is no index that satisfies the conditions in the problem statement.