下面是 Java 代码实现:
class Solution {
public int pivotIndex(int[] nums) {
int sum = 0;
int leftSum = 0;
for (int num : nums) {
sum += num;
}
for (int i = 0; i < nums.length; i++) {
if (leftSum == sum - leftSum - nums[i]) {