递归思路：if (startIndex % 2 == 0) return numbers[startIndex] + computeSumAtEven(numbers, startIndex + 1, endIndex)else return computeSumAtEven(numbers, startIndex + 1, endIndex)自己补齐base case
这个还用得着递归吗？
