Given an array of non-negative integers, perform a series of operations until the array becomes empty. each of the operations gives a score, and the goal is to maximize the overall score, the sum of the scores from all operations on the array. java

for odd length
{3,3,3}
3+3+3 = 9
sumo = 9;

remove right-most index. now even length
{3,3}
3+3 = 6
sume = 6;

sume-sumo = 9-6 = 3
sums = 3
remove left-most index. now odd length
{3}
sums + 3 = 3+3 = 6
remove right-most index. array lenght is zero
{}
maxscore = 6;