# Predict the Winner

Given an array of scores that are 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, that number will not be available for the next player. This continues until all the scores have been chosen. The player with the maximum score wins.

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

**Example 1:**

```
Input:
 [1, 5, 2]

Output:
 False

Explanation:
 Initially, player 1 can choose between 1 and 2. 


If he chooses 2 (or 1), then player 2 can choose from 1 (or 2) and 5. If player 2 chooses 5, then player 1 will be left with 1 (or 2). 


So, final score of player 1 is 1 + 2 = 3, and player 2 is 5. 


Hence, player 1 will never be the winner and you need to return False.
```

**Example 2:**

```
Input:
 [1, 5, 233, 7]

Output:
 True

Explanation:
 Player 1 first chooses 1. Then player 2 have to choose between 5 and 7. No matter which number player 2 choose, player 1 can choose 233.


Finally, player 1 has more score (234) than player 2 (12), so you need to return True representing player1 can win.
```

**Note:**

1. 1 

   <

   \= length of the array&#x20;

   <

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

分析

dp存当前i,j范围内，2个player的得分差。

当前得分去掉对手赢的得分差。

len 长度1-n-1 长度0时候就是Nums\[i]，i \[0，n-1]

```
class Solution:
    def PredictTheWinner(self, nums: List[int]) -> bool:
        n = len(nums)
        # sm = [0]*(n+1)
        # for i in range(n):
        #     sm[i+1] = sm[i]+nums[i]
        #dp:diff between players
        dp = [[float('-inf')]*(n) for _ in range(n)]
        # dp[0][0] = 0
        for i in range(n):
            dp[i][i] = nums[i]#长度0
        for ln in range(1,n):  #长度1->n-1          
            for i in range(0,n-ln):
                dp[i][i+ln] = max(nums[i] - dp[i+1][i+ln],nums[i+ln]-dp[i][i+ln-1])
        return dp[0][n-1] >=0
```

dfs

```
class Solution:
    def PredictTheWinner(self, nums: List[int]) -> bool:
        n = len(nums)

        dp = [[float('-inf')]*(n) for _ in range(n)]
        def dfs(s,e):
            if s>e:
                return 0
            if dp[s][e] != float('-inf'):
                return dp[s][e]
            if s==e:
                return nums[s]
            dp[s][e] = max(nums[s]-dfs(s+1,e),nums[e]-dfs(s,e-1))
            return dp[s][e]
        return dfs(0,n-1)>=0
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://nataliekung.gitbook.io/ladder_code/l4dong-tai-gui-hua/predict-the-winner.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.