724. Find Pivot Index

最新推荐文章于 2024-10-09 22:28:58 发布

兔兔爱学习兔兔爱学习

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量264

点赞数 3

分类专栏： LeetCode刷题文章标签：算法数据结构 leetcode python 学习

本文链接：https://blog.csdn.net/weixin_44245188/article/details/140792422

版权

LeetCode刷题专栏收录该内容

26 篇文章 0 订阅

订阅专栏

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

Example 2:

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

Example 3:

Input: nums = [2,1,-1]
Output: 0
Explanation:
The pivot index is 0.
Left sum = 0 (no elements to the left of index 0)
Right sum = nums[1] + nums[2] = 1 + -1 = 0

Constraints:

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

链接: 724. Find Pivot Index

思路一：使用指针。for循环遍历每一个index，右边和的变化是每次减一个数，左边和的变化是每次加一个数。

class Solution:
    def pivotIndex(self, nums: List[int]) -> int:
        sum_left,sum_right=0,sum(nums)
        for i in range(len(nums)):
            sum_right-=nums[i]
            if sum_left==sum_right:
                return i 
            sum_left+=nums[i]
        return -1

思路二：使用切片，效率较低

class Solution:
    def pivotIndex(self, nums: List[int]) -> int:
        for i in range(len(nums)):
            if sum(nums[:i])==sum(nums[i+1:]):return i 
        return -1