剑指 Offer II 012. 左右两边子数组的和相等

之前想的是分情况讨论，然后正常做

class Solution:
    def pivotIndex(self, nums: List[int]) -> int:
        if len(nums)<1:
            return -1
        elif len(nums)==1:
            return 0 
        sumV = sum(nums)
        if sumV==nums[0]:
            return 0
        acc = 0
        left,right,flag = nums[0],0,-1
        for i in range(1,len(nums)):
            if (sumV == 2*left + nums[i]):
                flag = i
                break
            left+=nums[i]
        return flag

这里要注意示例3的情况（浪费一次提交）

后来看结果，貌似不用考虑特殊情况

 

class Solution:
    def pivotIndex(self, nums: List[int]) -> int:
        sumV,left,flag = sum(nums),0,-1
        for i in range(len(nums)):
            if (sumV == 2*left + nums[i]):
                flag = i
                break
            left+=nums[i]
        return flag