# 724.Find-Pivot-Index

## 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.
```

## 代码

### Approach #1 Prefix Sum

```java
class Solution {
  public int pivotIndex(int[] nums) {
        int sum = 0, leftsum = 0;
    for (int x: nums) {
      sum += x;
    }
    for (int i = 0; i < nums.length; i++) {
      if (leftsum == sum - leftsum - nums[i]) {
        return i;
      }
      leftsum += nums[i];
    }
    return -1;
  }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/array/724.find-pivot-index.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.