题目地址：https://leetcode.com/problems/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:
代码语言：javascript复制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:
代码语言：javascript复制Input:
nums = [1, 2, 3]
Output: -1
Explanation:
There is no index that satisfies the conditions in the problem statement.Note:
- The length of
numswill be in the range[0, 10000]. - Each element
nums[i]will be an integer in the range[-1000, 1000].
给定一个整数类型的数组 nums，请编写一个能够返回数组“中心索引”的方法。
我们是这样定义数组中心索引的：数组中心索引的左侧所有元素相加的和等于右侧所有元素相加的和。
如果数组不存在中心索引，那么我们应该返回 -1。如果数组有多个中心索引，那么我们应该返回最靠近左边的那一个。
示例 1:
代码语言：javascript复制输入:
nums = [1, 7, 3, 6, 5, 6]
输出: 3
解释:
索引3 (nums[3] = 6) 的左侧数之和(1 7 3 = 11)，与右侧数之和(5 6 = 11)相等。
同时, 3 也是第一个符合要求的中心索引。示例 2:
代码语言：javascript复制输入:
nums = [1, 2, 3]
输出: -1
解释:
数组中不存在满足此条件的中心索引。说明:
nums的长度范围为[0, 10000]。- 任何一个
nums[i]将会是一个范围在[-1000, 1000]的整数。
class Solution {
public int pivotIndex(int[] nums) {
int sum = 0, sum_l = 0;
for (int i = 0; i < nums.length; i){
sum = nums[i];
}
if (nums.length > 0 && sum - nums[0] == sum_l) return 0;
for (int i = 0; i < nums.length; i){
sum_l = nums[i];
sum -= nums[i];
if (i 1 < nums.length && sum - nums[i 1] == sum_l){
return i 1;
}
}
return -1;
}
}
