724. Find Pivot Index -- Python

724. Find Pivot Index

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.

Note:

• The length of nums will be in the range [0, 10000].

• Each element nums[i] will be an integer in the range [-1000, 1000].

思路：
当然最先考虑的是依次从左往右遍历，遇见第一个中间数（左边数的和=右边数的和）直接返回就可以了，第一版，是将左右相加，当数组很长的时候，明显效率不高，每一个都要加2遍，借鉴了讨论区的思路，那就直接加一次留下面用，然后直接除2，等于左边就可以返回了，这次可以被接受了。不过稍加改动效率最快的是代码3。

我的代码1：（又是因为时间太长，未被接受）

class Solution:
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums)>2:
            for i in range(0,len(nums)):
                if sum(nums[0:i])==sum(nums[i+1:]):
                    return i
            else:
                return -1
        else:
            return -1

我的代码2：（借鉴改进思路，被接受版）

class Solution:
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        add_num=sum(nums)
        left_sum=0
        for i in range(0,len(nums)):
            if (add_num-nums[i])/2==left_sum:
                return i
            else:
                left_sum+=nums[i]
        else:
            return -1

代码3：

class Solution:
    def pivotIndex(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        add_num=sum(nums)
        left_sum=0
        for i in range(0,len(nums)):
            add_num-=nums[i]
            if add_num==left_sum:
                return i
            else:
                left_sum+=nums[i]
        else:
            return -1