There are n candies put from left to right on a table. The candies are numbered from left to right. The i-th candy has weight candies[i]. Alice and Bob eat candies.
Alice can eat any number of candies from the left (she can't skip candies, she eats them in a row).
Bob can eat any number of candies from the right (he can't skip candies, he eats them in a row).
Of course, if Alice ate a candy, Bob can't eat it (and vice versa).
They want to be fair. Their goal is to eat the same total weight of candies. What is the most number of candies they can eat in total?

Signature
public int maxCandiesCount(int[] candies):

Example 1
candies:[1000]
There is only candy, and it is not possible for Alice and Bob to eat the same total weight. 

Example 2...