算法-前缀和

724. 寻找数组的中心下标

前缀和：中心思想：sum[i] = sum[i - 1] + nums[i];

    public int pivotIndex(int[] nums) {
    	int res = -1;
    	int sum = 0;
    	for (int num : nums) {
    		sum += num;
    	}
    	int left = 0;
    	int right = sum;
    	for (int i = 0; i < nums.length; i++) {
    		right -= nums[i];
    		if (left == right) {
    			return i;
    		}
    		left += nums[i];
    	}
    	return res;
    }