LeetCode Solution, Easy, 1991. Find the Middle Index in Array

1991. Find the Middle Index in Array 題目敘述 Given a 0-indexed integer array nums, find the leftmost middleIndex (i.e., the smallest amongst all the possible ones). A middleIndex is an index where nums[0] + nums[1] + ... + nums[middleIndex-1] == nums[mi...