724. Find Pivot Index

最新推荐文章于 2021-01-24 14:27:15 发布

原创最新推荐文章于 2021-01-24 14:27:15 发布 · 161 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leedcode

Leetcode 同时被 3 个专栏收录

89 篇文章

订阅专栏

leetcode

85 篇文章

订阅专栏

算法

83 篇文章

订阅专栏

本文介绍了一种算法，用于在一列整数中找到一个特定的索引位置，该位置左边所有元素的总和等于其右边所有元素的总和。如果这样的索引存在，则返回它；否则返回-1。文章提供了详细的解决思路及Java实现代码。

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.

题意：

一列数找到i使得a[0]+……a[i]=a[i]+……+a[nums.length-1]。若找到就返回i，找不到则返回-1.

思路：

先求整个序列的和。再遍历数组，边遍历边加，直至出现ans=sum-ans+nums[i]。遍历完之后还没有满足的就return -1.

代码：

class Solution {
    public int pivotIndex(int[] nums) {
        long sum=0;
        for(int i=0;i<nums.length;i++)
            sum+=nums[i];
        long ans=0;
        for(int i=0;i<nums.length;i++)
        {
            ans+=nums[i];
            if(ans*2==(sum+nums[i]))
                return i;
        }
        return -1;
    }
}