[1991] Find the Middle Index in Array

說是跟724一樣的題目嗎～

結果我還是不會寫

我是不是很笨啊屋屋屋

int findMiddleIndex(int* nums, int numsSize){

int* left = malloc (sizeof(int)* numsSize);

int sum=0;

for (int i=0;i<numsSize; i++)

{

sum+=nums[i];

left[i]=sum-nums[i];

}

for (int i=0;i<numsSize; i++)

{

int check = sum - left[i]- nums[i];

if (check == left[i])

return i;

}

return -1;

}