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;