877. Stone Game 石头游戏 (未完成)

Alex and Lee play a game with piles of stones.  There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].

The objective of the game is to end with the most stones.  The total number of stones is odd, so there are no ties.

Alex and Lee take turns, with Alex starting first.  Each turn, a player takes the entire pile of stones from either the beginning or the end of the row.  This continues until there are no more piles left, at which point the person with the most stones wins.

Assuming Alex and Lee play optimally, return True if and only if Alex wins the game.

Example 1:

Input: [5,3,4,5]
Output: true
Explanation: 
Alex starts first, and can only take the first 5 or the last 5.
Say he takes the first 5, so that the row becomes [3, 4, 5].
If Lee takes 3, then the board is [4, 5], and Alex takes 5 to win with 10 points.
If Lee takes the last 5, then the board is [3, 4], and Alex takes 4 to win with 9 points.
This demonstrated that taking the first 5 was a winning move for Alex, so we return true.

Note:

1. 2 <= piles.length <= 500
2. piles.length is even.
3. 1 <= piles[i] <= 500
4. sum(piles) is odd.

 题意：给出一个数组，代表很多堆石头，数组中的每个数代表每堆石头的数量。在保证石头堆数是偶数、石头总数是奇数的情况下，让Alex和Lee依次轮换选取石头堆，但每次只能选择未选石头堆两端的堆，求最后Alex选取的石头总数是否能大于Lee。

思路：alex先挑，而且两人挑的堆数相同，所以Alex如何都有机会赢。

代码：使用了递归，结果超时了，但是思路基本上没有问题。

class Solution {
    int[] nums;
    int sum=0;
    public boolean stoneGame(int[] piles) {
        int len = piles.length;
        nums = new int[len];
        for(int i=0;i<len;i++){
            nums[i] = piles[i];
            sum+=piles[i];
        }
        return selectStone(1,len-1,nums[0],0)|| selectStone(0,len-2,0,nums[len-1]) ;
    }
    
    public boolean selectStone(int start,int end,int sumAlex,int sumLee){
        System.out.println(start+" "+end+" "+sumAlex+" "+sumLee);
        if(sumAlex*2 > sum){
            System.out.println("sumAlex*2:"+start+" "+end+" "+sumAlex+" "+sumLee);
            return true;
        }
        if(sumLee*2 > sum){  
            System.out.println("sumLee*2:"+start+" "+end+" "+sumAlex+" "+sumLee);
            return false;
        }
        int turn = end - start +1 ;
        if(turn % 2 ==1){
            if(turn == 1)
            {
                System.out.println("last:"+start+" "+end+" "+sumAlex+" "+sumLee);
                sumLee += nums[start];
                if(sumAlex > sumLee){                       
                    return true;
                }                     
                return false;
            }
            return selectStone(start+1,end,sumAlex,sumLee+nums[start]) ||  selectStone(start,end-1,sumAlex,sumLee+nums[end]);
        }else{
            return selectStone(start+1,end,sumAlex+nums[start],sumLee) ||  selectStone(start,end-1,sumAlex+nums[end],sumLee);
        }
    }
}