Minimax-486. Predict the Winner

Given an array of scores that is non-negative integers. Player 1 Picks one of the numbers from either end of the array followed by the Player 2 and then player 1 and so on. Each time a player picks a number, and that number is not being available for the next player. This continues until all the scores has been chosen. The player with the maximum score wins.

Given an array of scores, predict whether player 1 is the winner. You can assume all player plays to maximize his score.

Example 1:

Hence, Player 1 'll never is the winner and you need to return False.

Example 2:

Input: [1, 5, 233, 7]output:trueexplanation:player 1 first chooses 1. Then player 2 has to choose between 5 and 7. No matter which number player 2 choose, Player 1 can choose 233.
Finally, Player 1 has the more score (234) than Player 2 (a), so you need to return True representing Player1 can win.

Note:

1. 1 <= length of the array <= 20.
2. Any scores in the given array is non-negative integers and would not exceed 10,000,000.
3. If the scores of both players is equal, then player 1 is still the winner.

classSolution { Public:    BOOLPredictthewinner (vector<int>&nums) {        intn =nums.size (); Vector<vector<int>> DP (N, vector<int> (n,0));  for(inti =0; I < n; ++i) Dp[i][i] =Nums[i];  for(intLen =1; Len < n; ++Len) {             for(inti =0, j = Len; J < N; ++i, + +j) {Dp[i][j]= Max (Nums[i]-dp[i +1][J], Nums[j]-dp[i][j-1]); }        }        returndp[0][n-1] >=0; }};

Minimax-486. Predict the Winner