leetcode486 Predict the Winner

思路：

博弈。

实现：

 class Solution
 {
 public:

     bool PredictTheWinner(vector<int>& nums)
     {
         int dp[][];
         int n = nums.size();
         for (int i = ; i < n; i++) dp[i][i] = nums[i];
         for (int i = n - ; i >= ; i--)
         {
             for (int j = i + ; j < n; j++)
             {
                 dp[i][j] = max(nums[i] - dp[i + ][j], nums[j] - dp[i][j - ]);
             }
         }
         return dp[][n - ] >= ;
     }
 };