K kevin36

Reputation:

The idea is that this is a minimax game, and if you went to MIT and took 6.046 then you would have seen something similar to this problem in class. And thanks to MIT OCW everyone can see the explanation

public:

    bool PredictTheWinner(vector<int>& nums) {

        if(nums.size()%  == ) return true;

        int n = nums.size();

        vector<vector<int>> dp(n, vector<int>(n, -));

        int myBest = utill(nums, dp, , n-);

        return *myBest >= accumulate(nums.begin(), nums.end(), );

    }

    int utill(vector<int>& v, vector<vector<int>> &dp, int i, int j){

        if(i > j) return ;

        if(dp[i][j] != -) return dp[i][j];

        int a = v[i] + min(utill(v,dp, i+, j-), utill(v, dp, i+, j));

        int b = v[j] + min(utill(v,dp,i, j-), utill(v,dp, i+, j-));

        dp[i][j] = max(a, b);

        return dp[i][j];

    }

};