• leetcode 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.
    
    典型的空间换时间:
    class Solution(object):
        def pivotIndex(self, nums):
            """
            :type nums: List[int]
            :rtype: int
            """
            n = len(nums)
            s1, s2 = [0]*n, [0]*n
            sum1, sum2 = 0, 0
            for i in xrange(0, n):
                sum1 += nums[i]
                sum2 += nums[n-1-i]
                s1[i] = sum1
                s2[n-1-i] = sum2
            for i in xrange(0, n):
                if s1[i] == s2[i]:
                    return i
            return -1
    

    如果不用O(n)空间,则:

    class Solution(object):
        def pivotIndex(self, nums):
            """
            :type nums: List[int]
            :rtype: int
            """        
            s1 = sum(nums)
            s2 = 0
            for i in xrange(0, len(nums)):            
                s2 += nums[i]
                if s1 - s2 == s2 - nums[i]:
                    return i
            return -1
    
  • 相关阅读:
    计算欧拉函数值
    矩阵快速幂
    约瑟夫环数学公式
    整型输出输入优化
    计算机设计第三章
    计算机设计第二章
    计算机设计
    阿里巴巴秋招2017客户端附加题
    程序设计基本概念
    c++面试题
  • 原文地址:https://www.cnblogs.com/bonelee/p/9113942.html
Copyright © 2020-2023  润新知