[LeetCode] 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.

minimax算法：

public class Solution {
    public boolean PredictTheWinner(int[] nums) {
	      if(nums.length==0) return true;
	      return minimax(nums,0,nums.length-1,1);
	 }
	 int sum1=0,sum2=0;
	 public boolean minimax(int[] nums,int l,int r,int player){
		 if(l>r) return sum1>=sum2;
		 if(player==1){
			 boolean re=false;
			 sum1+=nums[l];
			 re=minimax(nums, l+1, r, 2);
			 sum1-=nums[l];
			 if(re) return re;
			 sum1+=nums[r];
			 re=minimax(nums, l, r-1, 2);
			 sum1-=nums[r];
			 if(re) return re;
			 return re;
		 }else{
			 boolean re=false;
			 sum2+=nums[l];
			 re=minimax(nums, l+1, r, 1);
			 sum2-=nums[l];
			 if(!re) return re;
			 sum2+=nums[r];
			 re=minimax(nums, l, r-1, 1);
			 sum2-=nums[r];
			 if(!re) return re;
			 return re;
		 }
	 }
}

动态规划：

public class Solution2 {
	//动态规划
	public boolean PredictTheWinner(int[] nums) {
		int[][] dp=new int[nums.length][nums.length];
		for(int len=0;len<nums.length;len++){
			for(int i=0;i<nums.length-len;i++){
				int j=i+len;
				if(i==j) dp[i][j]=nums[i];
				else{
					dp[i][j]=Math.max(nums[i]-dp[i+1][j],nums[j]-dp[i][j-1]);
				}
			}
		}
		return dp[0][nums.length-1]>=0;
	}
}