zoukankan      html  css  js  c++  java
  • 724_Find-Pivot-Index

    724_Find-Pivot-Index

    Description

    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].

    Solution

    Java solution

    class Solution {
        public int pivotIndex(int[] nums) {
            int leftSum = 0, rightSum = 0;
            for (int num : nums) {
                rightSum += num;
            }
            for (int i=0; i<nums.length; i++) {
                rightSum -= nums[i];
                if (leftSum == rightSum) {
                    return i;
                }
                leftSum += nums[i];
            }
            return -1;
        }
    }
    

    Runtime: 42 ms

    Python solution

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

    Runtime: 76 ms

  • 相关阅读:
    第 2 章 MySQL 架构组成
    MySql学习笔记
    大型项目成功的关键
    内连接区别外连接
    UML2.0
    软件架构师之路
    UVA
    ZOJ
    UVA
    UVA
  • 原文地址:https://www.cnblogs.com/xugenpeng/p/9192499.html
Copyright © 2011-2022 走看看