[LeetCode] Find Pivot Index

Find Pivot Index - LeetCode

int pivotIndex(vector<int>& nums){
	int left_sum = 0;
	int right_sum = std::accumulate(nums.begin(), nums.end(), 0);
	int current_left = 0;

	for(int i = 0; i < nums.size(); i++){
		left_sum += current_left;
		right_sum -= nums[i];
		if(left_sum == right_sum){
			return i;
		}
		current_left = nums[i];
	}
	return -1;
}