zoukankan      html  css  js  c++  java
  • 724. Find Pivot Index

    1. Question

    724. Find Pivot Index

    https://leetcode.com/problems/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. Solution:

    class Solution:
        def pivotIndex(self, nums):
            """
            :type nums: List[int]
            :rtype: int
            """
            if nums is None:
                return -1
            size = len(nums)
    
            if size == 0:
                return -1
            if size == 1:
                return 0
            if size == 2:
                return -1
    
            all_sum = sum(nums)
            pivot = 0
            left_sum = 0
            right_sum = all_sum - nums[0]
            if right_sum == left_sum:
                return pivot
    
            for i in range(1, size):
                left_sum += nums[i - 1]
                right_sum -= nums[i]
                if left_sum == right_sum:
                    return i
            return -1

    3. Complexity Analysis

    Time Complexity : O(N)

    Space Complexity: O(1)

  • 相关阅读:
    第5章 简单的C程序设计——循环结构程序设计
    第4章 简单的C程序设计——选择结构程序设计
    通过wget工具下载指定文件中的URLs对应的资源并保存到指定的本地目录中去并进行文件完整性与可靠性校验
    Kaflka介绍
    分布式与集群
    Golang菜鸟教程day01
    优秀的github项目
    Golang教程
    windows下安装GDB
    nginx部署
  • 原文地址:https://www.cnblogs.com/ordili/p/9992169.html
Copyright © 2011-2022 走看看